/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf -i ../../../trunk/examples/svcomp/nla-digbench-scaling/mannadiv_unwindbound1.c
--------------------------------------------------------------------------------
This is Ultimate 0.2.2-dev-e106359-m
[2022-04-15 10:18:17,865 INFO L177 SettingsManager]: Resetting all preferences to default values...
[2022-04-15 10:18:17,899 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values
[2022-04-15 10:18:17,931 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring...
[2022-04-15 10:18:17,931 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values
[2022-04-15 10:18:17,932 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values
[2022-04-15 10:18:17,933 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values
[2022-04-15 10:18:17,935 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values
[2022-04-15 10:18:17,936 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values
[2022-04-15 10:18:17,937 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values
[2022-04-15 10:18:17,938 INFO L181 SettingsManager]: Resetting Sifa preferences to default values
[2022-04-15 10:18:17,939 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring...
[2022-04-15 10:18:17,939 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values
[2022-04-15 10:18:17,940 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values
[2022-04-15 10:18:17,941 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values
[2022-04-15 10:18:17,942 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values
[2022-04-15 10:18:17,942 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values
[2022-04-15 10:18:17,943 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values
[2022-04-15 10:18:17,945 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values
[2022-04-15 10:18:17,946 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values
[2022-04-15 10:18:17,947 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values
[2022-04-15 10:18:17,948 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values
[2022-04-15 10:18:17,949 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values
[2022-04-15 10:18:17,950 INFO L181 SettingsManager]: Resetting Referee preferences to default values
[2022-04-15 10:18:17,950 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values
[2022-04-15 10:18:17,953 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring...
[2022-04-15 10:18:17,953 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring...
[2022-04-15 10:18:17,953 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values
[2022-04-15 10:18:17,954 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values
[2022-04-15 10:18:17,954 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values
[2022-04-15 10:18:17,955 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring...
[2022-04-15 10:18:17,955 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values
[2022-04-15 10:18:17,955 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values
[2022-04-15 10:18:17,956 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values
[2022-04-15 10:18:17,957 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values
[2022-04-15 10:18:17,957 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring...
[2022-04-15 10:18:17,958 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values
[2022-04-15 10:18:17,958 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring...
[2022-04-15 10:18:17,958 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring...
[2022-04-15 10:18:17,959 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values
[2022-04-15 10:18:17,959 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values
[2022-04-15 10:18:17,960 INFO L188 SettingsManager]: Finished resetting all preferences to default values...
[2022-04-15 10:18:17,961 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf
[2022-04-15 10:18:17,968 INFO L113 SettingsManager]: Loading preferences was successful
[2022-04-15 10:18:17,968 INFO L115 SettingsManager]: Preferences different from defaults after loading the file:
[2022-04-15 10:18:17,970 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2022-04-15 10:18:17,970 INFO L138 SettingsManager]: * sizeof long=4
[2022-04-15 10:18:17,970 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true
[2022-04-15 10:18:17,970 INFO L138 SettingsManager]: * sizeof POINTER=4
[2022-04-15 10:18:17,970 INFO L138 SettingsManager]: * Check division by zero=IGNORE
[2022-04-15 10:18:17,970 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE
[2022-04-15 10:18:17,971 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE
[2022-04-15 10:18:17,971 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE
[2022-04-15 10:18:17,971 INFO L138 SettingsManager]: * sizeof long double=12
[2022-04-15 10:18:17,971 INFO L138 SettingsManager]: * Check if freed pointer was valid=false
[2022-04-15 10:18:17,971 INFO L138 SettingsManager]: * Use constant arrays=true
[2022-04-15 10:18:17,971 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE
[2022-04-15 10:18:17,972 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2022-04-15 10:18:17,972 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements
[2022-04-15 10:18:17,972 INFO L138 SettingsManager]: * To the following directory=./dump/
[2022-04-15 10:18:17,972 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode
[2022-04-15 10:18:17,972 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2022-04-15 10:18:17,972 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2022-04-15 10:18:17,972 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation
[2022-04-15 10:18:17,973 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION
[2022-04-15 10:18:17,973 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL
[2022-04-15 10:18:17,973 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true
[2022-04-15 10:18:17,973 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN
[2022-04-15 10:18:17,973 INFO L138 SettingsManager]: * Use separate solver for trace checks=false
WARNING: An illegal reflective access operation has occurred
WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int)
WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1
WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations
WARNING: All illegal access operations will be denied in a future release
Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN;
[2022-04-15 10:18:18,143 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp
[2022-04-15 10:18:18,160 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2022-04-15 10:18:18,162 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2022-04-15 10:18:18,162 INFO L271 PluginConnector]: Initializing CDTParser...
[2022-04-15 10:18:18,167 INFO L275 PluginConnector]: CDTParser initialized
[2022-04-15 10:18:18,168 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/mannadiv_unwindbound1.c
[2022-04-15 10:18:18,216 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/de7c5f14a/511dd0697e5e494193f7b40ba11ffe59/FLAGb040fa639
[2022-04-15 10:18:18,547 INFO L306 CDTParser]: Found 1 translation units.
[2022-04-15 10:18:18,547 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/mannadiv_unwindbound1.c
[2022-04-15 10:18:18,553 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/de7c5f14a/511dd0697e5e494193f7b40ba11ffe59/FLAGb040fa639
[2022-04-15 10:18:18,994 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/de7c5f14a/511dd0697e5e494193f7b40ba11ffe59
[2022-04-15 10:18:18,996 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2022-04-15 10:18:18,998 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements.
[2022-04-15 10:18:19,000 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2022-04-15 10:18:19,000 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator...
[2022-04-15 10:18:19,004 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized
[2022-04-15 10:18:19,005 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 10:18:18" (1/1) ...
[2022-04-15 10:18:19,006 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1ac02aa3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 10:18:19, skipping insertion in model container
[2022-04-15 10:18:19,006 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 10:18:18" (1/1) ...
[2022-04-15 10:18:19,012 INFO L145 MainTranslator]: Starting translation in SV-COMP mode
[2022-04-15 10:18:19,026 INFO L178 MainTranslator]: Built tables and reachable declarations
[2022-04-15 10:18:19,156 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/mannadiv_unwindbound1.c[573,586]
[2022-04-15 10:18:19,170 INFO L210 PostProcessor]: Analyzing one entry point: main
[2022-04-15 10:18:19,177 INFO L203 MainTranslator]: Completed pre-run
[2022-04-15 10:18:19,187 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/mannadiv_unwindbound1.c[573,586]
[2022-04-15 10:18:19,191 INFO L210 PostProcessor]: Analyzing one entry point: main
[2022-04-15 10:18:19,201 INFO L208 MainTranslator]: Completed translation
[2022-04-15 10:18:19,201 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 10:18:19 WrapperNode
[2022-04-15 10:18:19,201 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2022-04-15 10:18:19,202 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2022-04-15 10:18:19,202 INFO L271 PluginConnector]: Initializing Boogie Preprocessor...
[2022-04-15 10:18:19,202 INFO L275 PluginConnector]: Boogie Preprocessor initialized
[2022-04-15 10:18:19,210 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 10:18:19" (1/1) ...
[2022-04-15 10:18:19,210 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 10:18:19" (1/1) ...
[2022-04-15 10:18:19,215 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 10:18:19" (1/1) ...
[2022-04-15 10:18:19,215 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 10:18:19" (1/1) ...
[2022-04-15 10:18:19,220 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 10:18:19" (1/1) ...
[2022-04-15 10:18:19,224 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 10:18:19" (1/1) ...
[2022-04-15 10:18:19,225 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 10:18:19" (1/1) ...
[2022-04-15 10:18:19,226 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2022-04-15 10:18:19,227 INFO L113 PluginConnector]: ------------------------RCFGBuilder----------------------------
[2022-04-15 10:18:19,230 INFO L271 PluginConnector]: Initializing RCFGBuilder...
[2022-04-15 10:18:19,230 INFO L275 PluginConnector]: RCFGBuilder initialized
[2022-04-15 10:18:19,231 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 10:18:19" (1/1) ...
[2022-04-15 10:18:19,237 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2022-04-15 10:18:19,247 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2022-04-15 10:18:19,257 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null)
[2022-04-15 10:18:19,259 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process
[2022-04-15 10:18:19,286 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init
[2022-04-15 10:18:19,287 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2022-04-15 10:18:19,287 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error
[2022-04-15 10:18:19,287 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not
[2022-04-15 10:18:19,287 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert
[2022-04-15 10:18:19,287 INFO L138 BoogieDeclarations]: Found implementation of procedure main
[2022-04-15 10:18:19,288 INFO L130 BoogieDeclarations]: Found specification of procedure abort
[2022-04-15 10:18:19,288 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail
[2022-04-15 10:18:19,288 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error
[2022-04-15 10:18:19,289 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2022-04-15 10:18:19,289 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int
[2022-04-15 10:18:19,290 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not
[2022-04-15 10:18:19,292 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert
[2022-04-15 10:18:19,292 INFO L130 BoogieDeclarations]: Found specification of procedure main
[2022-04-15 10:18:19,292 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init
[2022-04-15 10:18:19,292 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int
[2022-04-15 10:18:19,293 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2022-04-15 10:18:19,293 INFO L130 BoogieDeclarations]: Found specification of procedure write~int
[2022-04-15 10:18:19,293 INFO L130 BoogieDeclarations]: Found specification of procedure read~int
[2022-04-15 10:18:19,293 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc
[2022-04-15 10:18:19,341 INFO L234 CfgBuilder]: Building ICFG
[2022-04-15 10:18:19,342 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation
[2022-04-15 10:18:19,444 INFO L275 CfgBuilder]: Performing block encoding
[2022-04-15 10:18:19,449 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2022-04-15 10:18:19,450 INFO L299 CfgBuilder]: Removed 1 assume(true) statements.
[2022-04-15 10:18:19,451 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 10:18:19 BoogieIcfgContainer
[2022-04-15 10:18:19,451 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2022-04-15 10:18:19,453 INFO L113 PluginConnector]: ------------------------TraceAbstraction----------------------------
[2022-04-15 10:18:19,453 INFO L271 PluginConnector]: Initializing TraceAbstraction...
[2022-04-15 10:18:19,455 INFO L275 PluginConnector]: TraceAbstraction initialized
[2022-04-15 10:18:19,455 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.04 10:18:18" (1/3) ...
[2022-04-15 10:18:19,456 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c4e44c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 10:18:19, skipping insertion in model container
[2022-04-15 10:18:19,456 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 10:18:19" (2/3) ...
[2022-04-15 10:18:19,456 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c4e44c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 10:18:19, skipping insertion in model container
[2022-04-15 10:18:19,457 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 10:18:19" (3/3) ...
[2022-04-15 10:18:19,457 INFO L111 eAbstractionObserver]: Analyzing ICFG mannadiv_unwindbound1.c
[2022-04-15 10:18:19,461 INFO L202 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION
[2022-04-15 10:18:19,462 INFO L161 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations.
[2022-04-15 10:18:19,495 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2022-04-15 10:18:19,500 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=Craig_NestedInterpolation, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP
[2022-04-15 10:18:19,501 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2022-04-15 10:18:19,515 INFO L276 IsEmpty]: Start isEmpty. Operand has 30 states, 18 states have (on average 1.3888888888888888) internal successors, (25), 19 states have internal predecessors, (25), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6)
[2022-04-15 10:18:19,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23
[2022-04-15 10:18:19,521 INFO L491 BasicCegarLoop]: Found error trace
[2022-04-15 10:18:19,522 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-04-15 10:18:19,522 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2022-04-15 10:18:19,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-04-15 10:18:19,526 INFO L85 PathProgramCache]: Analyzing trace with hash -1859024204, now seen corresponding path program 1 times
[2022-04-15 10:18:19,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION
[2022-04-15 10:18:19,546 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [62475547]
[2022-04-15 10:18:19,557 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation
[2022-04-15 10:18:19,557 INFO L85 PathProgramCache]: Analyzing trace with hash -1859024204, now seen corresponding path program 2 times
[2022-04-15 10:18:19,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-04-15 10:18:19,560 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1836426307]
[2022-04-15 10:18:19,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-04-15 10:18:19,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-04-15 10:18:19,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-15 10:18:19,728 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0
[2022-04-15 10:18:19,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-15 10:18:19,755 INFO L290 TraceCheckUtils]: 0: Hoare triple {46#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {33#true} is VALID
[2022-04-15 10:18:19,757 INFO L290 TraceCheckUtils]: 1: Hoare triple {33#true} assume true; {33#true} is VALID
[2022-04-15 10:18:19,757 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {33#true} {33#true} #67#return; {33#true} is VALID
[2022-04-15 10:18:19,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6
[2022-04-15 10:18:19,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-15 10:18:19,788 INFO L290 TraceCheckUtils]: 0: Hoare triple {33#true} ~cond := #in~cond; {33#true} is VALID
[2022-04-15 10:18:19,789 INFO L290 TraceCheckUtils]: 1: Hoare triple {33#true} assume 0 == ~cond;assume false; {34#false} is VALID
[2022-04-15 10:18:19,789 INFO L290 TraceCheckUtils]: 2: Hoare triple {34#false} assume true; {34#false} is VALID
[2022-04-15 10:18:19,789 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {34#false} {33#true} #59#return; {34#false} is VALID
[2022-04-15 10:18:19,790 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11
[2022-04-15 10:18:19,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-15 10:18:19,801 INFO L290 TraceCheckUtils]: 0: Hoare triple {33#true} ~cond := #in~cond; {33#true} is VALID
[2022-04-15 10:18:19,801 INFO L290 TraceCheckUtils]: 1: Hoare triple {33#true} assume 0 == ~cond;assume false; {34#false} is VALID
[2022-04-15 10:18:19,802 INFO L290 TraceCheckUtils]: 2: Hoare triple {34#false} assume true; {34#false} is VALID
[2022-04-15 10:18:19,802 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {34#false} {34#false} #61#return; {34#false} is VALID
[2022-04-15 10:18:19,803 INFO L272 TraceCheckUtils]: 0: Hoare triple {33#true} call ULTIMATE.init(); {46#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID
[2022-04-15 10:18:19,803 INFO L290 TraceCheckUtils]: 1: Hoare triple {46#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {33#true} is VALID
[2022-04-15 10:18:19,804 INFO L290 TraceCheckUtils]: 2: Hoare triple {33#true} assume true; {33#true} is VALID
[2022-04-15 10:18:19,804 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {33#true} {33#true} #67#return; {33#true} is VALID
[2022-04-15 10:18:19,804 INFO L272 TraceCheckUtils]: 4: Hoare triple {33#true} call #t~ret7 := main(); {33#true} is VALID
[2022-04-15 10:18:19,804 INFO L290 TraceCheckUtils]: 5: Hoare triple {33#true} havoc ~x1~0;havoc ~x2~0;havoc ~y1~0;havoc ~y2~0;havoc ~y3~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x1~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~x2~0 := #t~nondet5;havoc #t~nondet5; {33#true} is VALID
[2022-04-15 10:18:19,805 INFO L272 TraceCheckUtils]: 6: Hoare triple {33#true} call assume_abort_if_not((if ~x1~0 >= 0 then 1 else 0)); {33#true} is VALID
[2022-04-15 10:18:19,805 INFO L290 TraceCheckUtils]: 7: Hoare triple {33#true} ~cond := #in~cond; {33#true} is VALID
[2022-04-15 10:18:19,805 INFO L290 TraceCheckUtils]: 8: Hoare triple {33#true} assume 0 == ~cond;assume false; {34#false} is VALID
[2022-04-15 10:18:19,806 INFO L290 TraceCheckUtils]: 9: Hoare triple {34#false} assume true; {34#false} is VALID
[2022-04-15 10:18:19,806 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {34#false} {33#true} #59#return; {34#false} is VALID
[2022-04-15 10:18:19,806 INFO L272 TraceCheckUtils]: 11: Hoare triple {34#false} call assume_abort_if_not((if 0 != ~x2~0 then 1 else 0)); {33#true} is VALID
[2022-04-15 10:18:19,806 INFO L290 TraceCheckUtils]: 12: Hoare triple {33#true} ~cond := #in~cond; {33#true} is VALID
[2022-04-15 10:18:19,807 INFO L290 TraceCheckUtils]: 13: Hoare triple {33#true} assume 0 == ~cond;assume false; {34#false} is VALID
[2022-04-15 10:18:19,807 INFO L290 TraceCheckUtils]: 14: Hoare triple {34#false} assume true; {34#false} is VALID
[2022-04-15 10:18:19,807 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {34#false} {34#false} #61#return; {34#false} is VALID
[2022-04-15 10:18:19,807 INFO L290 TraceCheckUtils]: 16: Hoare triple {34#false} ~y1~0 := 0;~y2~0 := 0;~y3~0 := ~x1~0; {34#false} is VALID
[2022-04-15 10:18:19,808 INFO L290 TraceCheckUtils]: 17: Hoare triple {34#false} assume !true; {34#false} is VALID
[2022-04-15 10:18:19,808 INFO L272 TraceCheckUtils]: 18: Hoare triple {34#false} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 == ~x1~0 then 1 else 0)); {34#false} is VALID
[2022-04-15 10:18:19,808 INFO L290 TraceCheckUtils]: 19: Hoare triple {34#false} ~cond := #in~cond; {34#false} is VALID
[2022-04-15 10:18:19,808 INFO L290 TraceCheckUtils]: 20: Hoare triple {34#false} assume 0 == ~cond; {34#false} is VALID
[2022-04-15 10:18:19,808 INFO L290 TraceCheckUtils]: 21: Hoare triple {34#false} assume !false; {34#false} is VALID
[2022-04-15 10:18:19,809 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked.
[2022-04-15 10:18:19,809 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-04-15 10:18:19,810 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1836426307]
[2022-04-15 10:18:19,810 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1836426307] provided 1 perfect and 0 imperfect interpolant sequences
[2022-04-15 10:18:19,810 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-04-15 10:18:19,811 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2022-04-15 10:18:19,813 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace
[2022-04-15 10:18:19,813 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [62475547]
[2022-04-15 10:18:19,813 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [62475547] provided 1 perfect and 0 imperfect interpolant sequences
[2022-04-15 10:18:19,813 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-04-15 10:18:19,813 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2022-04-15 10:18:19,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [172925771]
[2022-04-15 10:18:19,814 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-04-15 10:18:19,818 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 22
[2022-04-15 10:18:19,824 INFO L84 Accepts]: Finished accepts. word is accepted.
[2022-04-15 10:18:19,827 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3)
[2022-04-15 10:18:19,868 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-15 10:18:19,868 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2022-04-15 10:18:19,869 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION
[2022-04-15 10:18:19,895 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2022-04-15 10:18:19,896 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2022-04-15 10:18:19,899 INFO L87 Difference]: Start difference. First operand has 30 states, 18 states have (on average 1.3888888888888888) internal successors, (25), 19 states have internal predecessors, (25), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3)
[2022-04-15 10:18:20,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-15 10:18:20,028 INFO L93 Difference]: Finished difference Result 54 states and 72 transitions.
[2022-04-15 10:18:20,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2022-04-15 10:18:20,028 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 22
[2022-04-15 10:18:20,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-04-15 10:18:20,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3)
[2022-04-15 10:18:20,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 72 transitions.
[2022-04-15 10:18:20,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3)
[2022-04-15 10:18:20,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 72 transitions.
[2022-04-15 10:18:20,043 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 72 transitions.
[2022-04-15 10:18:20,119 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 72 edges. 72 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-15 10:18:20,140 INFO L225 Difference]: With dead ends: 54
[2022-04-15 10:18:20,140 INFO L226 Difference]: Without dead ends: 26
[2022-04-15 10:18:20,143 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2022-04-15 10:18:20,145 INFO L913 BasicCegarLoop]: 31 mSDtfsCounter, 10 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2022-04-15 10:18:20,146 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [12 Valid, 35 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2022-04-15 10:18:20,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states.
[2022-04-15 10:18:20,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 25.
[2022-04-15 10:18:20,192 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa
[2022-04-15 10:18:20,193 INFO L82 GeneralOperation]: Start isEquivalent. First operand 26 states. Second operand has 25 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 16 states have internal predecessors, (19), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4)
[2022-04-15 10:18:20,193 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand has 25 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 16 states have internal predecessors, (19), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4)
[2022-04-15 10:18:20,194 INFO L87 Difference]: Start difference. First operand 26 states. Second operand has 25 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 16 states have internal predecessors, (19), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4)
[2022-04-15 10:18:20,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-15 10:18:20,198 INFO L93 Difference]: Finished difference Result 26 states and 30 transitions.
[2022-04-15 10:18:20,198 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 30 transitions.
[2022-04-15 10:18:20,199 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-15 10:18:20,199 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-15 10:18:20,199 INFO L74 IsIncluded]: Start isIncluded. First operand has 25 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 16 states have internal predecessors, (19), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 26 states.
[2022-04-15 10:18:20,200 INFO L87 Difference]: Start difference. First operand has 25 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 16 states have internal predecessors, (19), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 26 states.
[2022-04-15 10:18:20,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-15 10:18:20,203 INFO L93 Difference]: Finished difference Result 26 states and 30 transitions.
[2022-04-15 10:18:20,203 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 30 transitions.
[2022-04-15 10:18:20,203 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-15 10:18:20,203 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-15 10:18:20,204 INFO L88 GeneralOperation]: Finished isEquivalent.
[2022-04-15 10:18:20,204 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa
[2022-04-15 10:18:20,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 16 states have internal predecessors, (19), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4)
[2022-04-15 10:18:20,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 29 transitions.
[2022-04-15 10:18:20,207 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 29 transitions. Word has length 22
[2022-04-15 10:18:20,208 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-04-15 10:18:20,208 INFO L478 AbstractCegarLoop]: Abstraction has 25 states and 29 transitions.
[2022-04-15 10:18:20,208 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3)
[2022-04-15 10:18:20,208 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 25 states and 29 transitions.
[2022-04-15 10:18:20,240 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-15 10:18:20,241 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 29 transitions.
[2022-04-15 10:18:20,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24
[2022-04-15 10:18:20,242 INFO L491 BasicCegarLoop]: Found error trace
[2022-04-15 10:18:20,242 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-04-15 10:18:20,242 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2022-04-15 10:18:20,243 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2022-04-15 10:18:20,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-04-15 10:18:20,243 INFO L85 PathProgramCache]: Analyzing trace with hash 243739414, now seen corresponding path program 1 times
[2022-04-15 10:18:20,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION
[2022-04-15 10:18:20,244 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [596564315]
[2022-04-15 10:18:20,245 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation
[2022-04-15 10:18:20,245 INFO L85 PathProgramCache]: Analyzing trace with hash 243739414, now seen corresponding path program 2 times
[2022-04-15 10:18:20,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-04-15 10:18:20,245 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2118590483]
[2022-04-15 10:18:20,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-04-15 10:18:20,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-04-15 10:18:20,267 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic
[2022-04-15 10:18:20,267 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1216673911]
[2022-04-15 10:18:20,267 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2022-04-15 10:18:20,268 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2022-04-15 10:18:20,268 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2022-04-15 10:18:20,269 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2022-04-15 10:18:20,293 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process
[2022-04-15 10:18:20,326 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s)
[2022-04-15 10:18:20,327 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat
[2022-04-15 10:18:20,329 INFO L263 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 5 conjunts are in the unsatisfiable core
[2022-04-15 10:18:20,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-15 10:18:20,347 INFO L286 TraceCheckSpWp]: Computing forward predicates...
[2022-04-15 10:18:20,538 INFO L272 TraceCheckUtils]: 0: Hoare triple {259#true} call ULTIMATE.init(); {259#true} is VALID
[2022-04-15 10:18:20,539 INFO L290 TraceCheckUtils]: 1: Hoare triple {259#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {267#(<= ~counter~0 0)} is VALID
[2022-04-15 10:18:20,540 INFO L290 TraceCheckUtils]: 2: Hoare triple {267#(<= ~counter~0 0)} assume true; {267#(<= ~counter~0 0)} is VALID
[2022-04-15 10:18:20,540 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {267#(<= ~counter~0 0)} {259#true} #67#return; {267#(<= ~counter~0 0)} is VALID
[2022-04-15 10:18:20,541 INFO L272 TraceCheckUtils]: 4: Hoare triple {267#(<= ~counter~0 0)} call #t~ret7 := main(); {267#(<= ~counter~0 0)} is VALID
[2022-04-15 10:18:20,541 INFO L290 TraceCheckUtils]: 5: Hoare triple {267#(<= ~counter~0 0)} havoc ~x1~0;havoc ~x2~0;havoc ~y1~0;havoc ~y2~0;havoc ~y3~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x1~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~x2~0 := #t~nondet5;havoc #t~nondet5; {267#(<= ~counter~0 0)} is VALID
[2022-04-15 10:18:20,542 INFO L272 TraceCheckUtils]: 6: Hoare triple {267#(<= ~counter~0 0)} call assume_abort_if_not((if ~x1~0 >= 0 then 1 else 0)); {267#(<= ~counter~0 0)} is VALID
[2022-04-15 10:18:20,542 INFO L290 TraceCheckUtils]: 7: Hoare triple {267#(<= ~counter~0 0)} ~cond := #in~cond; {267#(<= ~counter~0 0)} is VALID
[2022-04-15 10:18:20,543 INFO L290 TraceCheckUtils]: 8: Hoare triple {267#(<= ~counter~0 0)} assume !(0 == ~cond); {267#(<= ~counter~0 0)} is VALID
[2022-04-15 10:18:20,544 INFO L290 TraceCheckUtils]: 9: Hoare triple {267#(<= ~counter~0 0)} assume true; {267#(<= ~counter~0 0)} is VALID
[2022-04-15 10:18:20,544 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {267#(<= ~counter~0 0)} {267#(<= ~counter~0 0)} #59#return; {267#(<= ~counter~0 0)} is VALID
[2022-04-15 10:18:20,545 INFO L272 TraceCheckUtils]: 11: Hoare triple {267#(<= ~counter~0 0)} call assume_abort_if_not((if 0 != ~x2~0 then 1 else 0)); {267#(<= ~counter~0 0)} is VALID
[2022-04-15 10:18:20,545 INFO L290 TraceCheckUtils]: 12: Hoare triple {267#(<= ~counter~0 0)} ~cond := #in~cond; {267#(<= ~counter~0 0)} is VALID
[2022-04-15 10:18:20,546 INFO L290 TraceCheckUtils]: 13: Hoare triple {267#(<= ~counter~0 0)} assume !(0 == ~cond); {267#(<= ~counter~0 0)} is VALID
[2022-04-15 10:18:20,547 INFO L290 TraceCheckUtils]: 14: Hoare triple {267#(<= ~counter~0 0)} assume true; {267#(<= ~counter~0 0)} is VALID
[2022-04-15 10:18:20,547 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {267#(<= ~counter~0 0)} {267#(<= ~counter~0 0)} #61#return; {267#(<= ~counter~0 0)} is VALID
[2022-04-15 10:18:20,548 INFO L290 TraceCheckUtils]: 16: Hoare triple {267#(<= ~counter~0 0)} ~y1~0 := 0;~y2~0 := 0;~y3~0 := ~x1~0; {267#(<= ~counter~0 0)} is VALID
[2022-04-15 10:18:20,548 INFO L290 TraceCheckUtils]: 17: Hoare triple {267#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {316#(<= |main_#t~post6| 0)} is VALID
[2022-04-15 10:18:20,549 INFO L290 TraceCheckUtils]: 18: Hoare triple {316#(<= |main_#t~post6| 0)} assume !(#t~post6 < 1);havoc #t~post6; {260#false} is VALID
[2022-04-15 10:18:20,549 INFO L272 TraceCheckUtils]: 19: Hoare triple {260#false} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 == ~x1~0 then 1 else 0)); {260#false} is VALID
[2022-04-15 10:18:20,550 INFO L290 TraceCheckUtils]: 20: Hoare triple {260#false} ~cond := #in~cond; {260#false} is VALID
[2022-04-15 10:18:20,550 INFO L290 TraceCheckUtils]: 21: Hoare triple {260#false} assume 0 == ~cond; {260#false} is VALID
[2022-04-15 10:18:20,550 INFO L290 TraceCheckUtils]: 22: Hoare triple {260#false} assume !false; {260#false} is VALID
[2022-04-15 10:18:20,550 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked.
[2022-04-15 10:18:20,551 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2022-04-15 10:18:20,551 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-04-15 10:18:20,551 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2118590483]
[2022-04-15 10:18:20,551 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT
[2022-04-15 10:18:20,552 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1216673911]
[2022-04-15 10:18:20,552 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1216673911] provided 1 perfect and 0 imperfect interpolant sequences
[2022-04-15 10:18:20,552 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-04-15 10:18:20,552 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2022-04-15 10:18:20,553 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace
[2022-04-15 10:18:20,553 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [596564315]
[2022-04-15 10:18:20,553 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [596564315] provided 1 perfect and 0 imperfect interpolant sequences
[2022-04-15 10:18:20,554 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-04-15 10:18:20,554 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2022-04-15 10:18:20,554 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [792071913]
[2022-04-15 10:18:20,554 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-04-15 10:18:20,555 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 23
[2022-04-15 10:18:20,555 INFO L84 Accepts]: Finished accepts. word is accepted.
[2022-04-15 10:18:20,555 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3)
[2022-04-15 10:18:20,574 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-15 10:18:20,574 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2022-04-15 10:18:20,574 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION
[2022-04-15 10:18:20,575 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2022-04-15 10:18:20,575 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2022-04-15 10:18:20,575 INFO L87 Difference]: Start difference. First operand 25 states and 29 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3)
[2022-04-15 10:18:20,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-15 10:18:20,646 INFO L93 Difference]: Finished difference Result 34 states and 38 transitions.
[2022-04-15 10:18:20,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states.
[2022-04-15 10:18:20,647 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 23
[2022-04-15 10:18:20,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-04-15 10:18:20,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3)
[2022-04-15 10:18:20,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 38 transitions.
[2022-04-15 10:18:20,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3)
[2022-04-15 10:18:20,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 38 transitions.
[2022-04-15 10:18:20,651 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 38 transitions.
[2022-04-15 10:18:20,683 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-15 10:18:20,684 INFO L225 Difference]: With dead ends: 34
[2022-04-15 10:18:20,685 INFO L226 Difference]: Without dead ends: 27
[2022-04-15 10:18:20,685 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2022-04-15 10:18:20,686 INFO L913 BasicCegarLoop]: 27 mSDtfsCounter, 0 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2022-04-15 10:18:20,687 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 67 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2022-04-15 10:18:20,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states.
[2022-04-15 10:18:20,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27.
[2022-04-15 10:18:20,704 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa
[2022-04-15 10:18:20,705 INFO L82 GeneralOperation]: Start isEquivalent. First operand 27 states. Second operand has 27 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 18 states have internal predecessors, (21), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4)
[2022-04-15 10:18:20,705 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand has 27 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 18 states have internal predecessors, (21), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4)
[2022-04-15 10:18:20,706 INFO L87 Difference]: Start difference. First operand 27 states. Second operand has 27 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 18 states have internal predecessors, (21), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4)
[2022-04-15 10:18:20,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-15 10:18:20,708 INFO L93 Difference]: Finished difference Result 27 states and 31 transitions.
[2022-04-15 10:18:20,708 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions.
[2022-04-15 10:18:20,708 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-15 10:18:20,708 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-15 10:18:20,709 INFO L74 IsIncluded]: Start isIncluded. First operand has 27 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 18 states have internal predecessors, (21), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 27 states.
[2022-04-15 10:18:20,709 INFO L87 Difference]: Start difference. First operand has 27 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 18 states have internal predecessors, (21), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 27 states.
[2022-04-15 10:18:20,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-15 10:18:20,711 INFO L93 Difference]: Finished difference Result 27 states and 31 transitions.
[2022-04-15 10:18:20,712 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions.
[2022-04-15 10:18:20,712 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-15 10:18:20,712 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-15 10:18:20,712 INFO L88 GeneralOperation]: Finished isEquivalent.
[2022-04-15 10:18:20,713 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa
[2022-04-15 10:18:20,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 18 states have internal predecessors, (21), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4)
[2022-04-15 10:18:20,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions.
[2022-04-15 10:18:20,715 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 31 transitions. Word has length 23
[2022-04-15 10:18:20,715 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-04-15 10:18:20,715 INFO L478 AbstractCegarLoop]: Abstraction has 27 states and 31 transitions.
[2022-04-15 10:18:20,715 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3)
[2022-04-15 10:18:20,716 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 27 states and 31 transitions.
[2022-04-15 10:18:20,747 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-15 10:18:20,747 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions.
[2022-04-15 10:18:20,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24
[2022-04-15 10:18:20,748 INFO L491 BasicCegarLoop]: Found error trace
[2022-04-15 10:18:20,748 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-04-15 10:18:20,779 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0
[2022-04-15 10:18:20,967 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2022-04-15 10:18:20,968 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2022-04-15 10:18:20,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-04-15 10:18:20,969 INFO L85 PathProgramCache]: Analyzing trace with hash 245526874, now seen corresponding path program 1 times
[2022-04-15 10:18:20,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION
[2022-04-15 10:18:20,969 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1046560718]
[2022-04-15 10:18:20,969 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation
[2022-04-15 10:18:20,970 INFO L85 PathProgramCache]: Analyzing trace with hash 245526874, now seen corresponding path program 2 times
[2022-04-15 10:18:20,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-04-15 10:18:20,970 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1694264490]
[2022-04-15 10:18:20,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-04-15 10:18:20,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-04-15 10:18:20,989 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic
[2022-04-15 10:18:20,990 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1620331323]
[2022-04-15 10:18:20,990 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2022-04-15 10:18:20,990 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2022-04-15 10:18:20,990 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2022-04-15 10:18:21,000 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2022-04-15 10:18:21,022 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process
[2022-04-15 10:18:21,038 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s)
[2022-04-15 10:18:21,039 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat
[2022-04-15 10:18:21,040 INFO L263 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 9 conjunts are in the unsatisfiable core
[2022-04-15 10:18:21,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-15 10:18:21,049 INFO L286 TraceCheckSpWp]: Computing forward predicates...
[2022-04-15 10:18:21,157 INFO L272 TraceCheckUtils]: 0: Hoare triple {507#true} call ULTIMATE.init(); {507#true} is VALID
[2022-04-15 10:18:21,157 INFO L290 TraceCheckUtils]: 1: Hoare triple {507#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {507#true} is VALID
[2022-04-15 10:18:21,158 INFO L290 TraceCheckUtils]: 2: Hoare triple {507#true} assume true; {507#true} is VALID
[2022-04-15 10:18:21,158 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {507#true} {507#true} #67#return; {507#true} is VALID
[2022-04-15 10:18:21,158 INFO L272 TraceCheckUtils]: 4: Hoare triple {507#true} call #t~ret7 := main(); {507#true} is VALID
[2022-04-15 10:18:21,158 INFO L290 TraceCheckUtils]: 5: Hoare triple {507#true} havoc ~x1~0;havoc ~x2~0;havoc ~y1~0;havoc ~y2~0;havoc ~y3~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x1~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~x2~0 := #t~nondet5;havoc #t~nondet5; {507#true} is VALID
[2022-04-15 10:18:21,158 INFO L272 TraceCheckUtils]: 6: Hoare triple {507#true} call assume_abort_if_not((if ~x1~0 >= 0 then 1 else 0)); {507#true} is VALID
[2022-04-15 10:18:21,158 INFO L290 TraceCheckUtils]: 7: Hoare triple {507#true} ~cond := #in~cond; {507#true} is VALID
[2022-04-15 10:18:21,159 INFO L290 TraceCheckUtils]: 8: Hoare triple {507#true} assume !(0 == ~cond); {507#true} is VALID
[2022-04-15 10:18:21,159 INFO L290 TraceCheckUtils]: 9: Hoare triple {507#true} assume true; {507#true} is VALID
[2022-04-15 10:18:21,159 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {507#true} {507#true} #59#return; {507#true} is VALID
[2022-04-15 10:18:21,159 INFO L272 TraceCheckUtils]: 11: Hoare triple {507#true} call assume_abort_if_not((if 0 != ~x2~0 then 1 else 0)); {507#true} is VALID
[2022-04-15 10:18:21,159 INFO L290 TraceCheckUtils]: 12: Hoare triple {507#true} ~cond := #in~cond; {507#true} is VALID
[2022-04-15 10:18:21,159 INFO L290 TraceCheckUtils]: 13: Hoare triple {507#true} assume !(0 == ~cond); {507#true} is VALID
[2022-04-15 10:18:21,160 INFO L290 TraceCheckUtils]: 14: Hoare triple {507#true} assume true; {507#true} is VALID
[2022-04-15 10:18:21,160 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {507#true} {507#true} #61#return; {507#true} is VALID
[2022-04-15 10:18:21,160 INFO L290 TraceCheckUtils]: 16: Hoare triple {507#true} ~y1~0 := 0;~y2~0 := 0;~y3~0 := ~x1~0; {560#(and (= main_~y2~0 0) (= main_~y1~0 0) (= main_~x1~0 main_~y3~0))} is VALID
[2022-04-15 10:18:21,161 INFO L290 TraceCheckUtils]: 17: Hoare triple {560#(and (= main_~y2~0 0) (= main_~y1~0 0) (= main_~x1~0 main_~y3~0))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {560#(and (= main_~y2~0 0) (= main_~y1~0 0) (= main_~x1~0 main_~y3~0))} is VALID
[2022-04-15 10:18:21,162 INFO L290 TraceCheckUtils]: 18: Hoare triple {560#(and (= main_~y2~0 0) (= main_~y1~0 0) (= main_~x1~0 main_~y3~0))} assume !!(#t~post6 < 1);havoc #t~post6; {560#(and (= main_~y2~0 0) (= main_~y1~0 0) (= main_~x1~0 main_~y3~0))} is VALID
[2022-04-15 10:18:21,163 INFO L272 TraceCheckUtils]: 19: Hoare triple {560#(and (= main_~y2~0 0) (= main_~y1~0 0) (= main_~x1~0 main_~y3~0))} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {570#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID
[2022-04-15 10:18:21,163 INFO L290 TraceCheckUtils]: 20: Hoare triple {570#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {574#(<= 1 __VERIFIER_assert_~cond)} is VALID
[2022-04-15 10:18:21,163 INFO L290 TraceCheckUtils]: 21: Hoare triple {574#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {508#false} is VALID
[2022-04-15 10:18:21,164 INFO L290 TraceCheckUtils]: 22: Hoare triple {508#false} assume !false; {508#false} is VALID
[2022-04-15 10:18:21,164 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked.
[2022-04-15 10:18:21,164 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2022-04-15 10:18:21,164 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-04-15 10:18:21,164 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1694264490]
[2022-04-15 10:18:21,164 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT
[2022-04-15 10:18:21,165 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1620331323]
[2022-04-15 10:18:21,165 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1620331323] provided 1 perfect and 0 imperfect interpolant sequences
[2022-04-15 10:18:21,165 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-04-15 10:18:21,165 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2022-04-15 10:18:21,165 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace
[2022-04-15 10:18:21,165 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1046560718]
[2022-04-15 10:18:21,166 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1046560718] provided 1 perfect and 0 imperfect interpolant sequences
[2022-04-15 10:18:21,166 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-04-15 10:18:21,166 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2022-04-15 10:18:21,166 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [299664485]
[2022-04-15 10:18:21,166 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-04-15 10:18:21,166 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 23
[2022-04-15 10:18:21,167 INFO L84 Accepts]: Finished accepts. word is accepted.
[2022-04-15 10:18:21,167 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3)
[2022-04-15 10:18:21,183 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-15 10:18:21,183 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2022-04-15 10:18:21,183 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION
[2022-04-15 10:18:21,184 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2022-04-15 10:18:21,184 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2022-04-15 10:18:21,184 INFO L87 Difference]: Start difference. First operand 27 states and 31 transitions. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3)
[2022-04-15 10:18:21,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-15 10:18:21,312 INFO L93 Difference]: Finished difference Result 37 states and 43 transitions.
[2022-04-15 10:18:21,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states.
[2022-04-15 10:18:21,313 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 23
[2022-04-15 10:18:21,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-04-15 10:18:21,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3)
[2022-04-15 10:18:21,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions.
[2022-04-15 10:18:21,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3)
[2022-04-15 10:18:21,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions.
[2022-04-15 10:18:21,325 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 43 transitions.
[2022-04-15 10:18:21,370 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-15 10:18:21,373 INFO L225 Difference]: With dead ends: 37
[2022-04-15 10:18:21,373 INFO L226 Difference]: Without dead ends: 35
[2022-04-15 10:18:21,374 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30
[2022-04-15 10:18:21,385 INFO L913 BasicCegarLoop]: 23 mSDtfsCounter, 7 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2022-04-15 10:18:21,385 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [8 Valid, 83 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2022-04-15 10:18:21,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states.
[2022-04-15 10:18:21,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 32.
[2022-04-15 10:18:21,403 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa
[2022-04-15 10:18:21,403 INFO L82 GeneralOperation]: Start isEquivalent. First operand 35 states. Second operand has 32 states, 20 states have (on average 1.2) internal successors, (24), 22 states have internal predecessors, (24), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5)
[2022-04-15 10:18:21,404 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand has 32 states, 20 states have (on average 1.2) internal successors, (24), 22 states have internal predecessors, (24), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5)
[2022-04-15 10:18:21,404 INFO L87 Difference]: Start difference. First operand 35 states. Second operand has 32 states, 20 states have (on average 1.2) internal successors, (24), 22 states have internal predecessors, (24), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5)
[2022-04-15 10:18:21,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-15 10:18:21,406 INFO L93 Difference]: Finished difference Result 35 states and 41 transitions.
[2022-04-15 10:18:21,406 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 41 transitions.
[2022-04-15 10:18:21,407 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-15 10:18:21,407 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-15 10:18:21,407 INFO L74 IsIncluded]: Start isIncluded. First operand has 32 states, 20 states have (on average 1.2) internal successors, (24), 22 states have internal predecessors, (24), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) Second operand 35 states.
[2022-04-15 10:18:21,407 INFO L87 Difference]: Start difference. First operand has 32 states, 20 states have (on average 1.2) internal successors, (24), 22 states have internal predecessors, (24), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) Second operand 35 states.
[2022-04-15 10:18:21,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-15 10:18:21,409 INFO L93 Difference]: Finished difference Result 35 states and 41 transitions.
[2022-04-15 10:18:21,409 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 41 transitions.
[2022-04-15 10:18:21,410 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-15 10:18:21,410 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-15 10:18:21,410 INFO L88 GeneralOperation]: Finished isEquivalent.
[2022-04-15 10:18:21,410 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa
[2022-04-15 10:18:21,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 20 states have (on average 1.2) internal successors, (24), 22 states have internal predecessors, (24), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5)
[2022-04-15 10:18:21,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 36 transitions.
[2022-04-15 10:18:21,412 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 36 transitions. Word has length 23
[2022-04-15 10:18:21,412 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-04-15 10:18:21,412 INFO L478 AbstractCegarLoop]: Abstraction has 32 states and 36 transitions.
[2022-04-15 10:18:21,412 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3)
[2022-04-15 10:18:21,413 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 32 states and 36 transitions.
[2022-04-15 10:18:21,446 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-15 10:18:21,446 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions.
[2022-04-15 10:18:21,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30
[2022-04-15 10:18:21,447 INFO L491 BasicCegarLoop]: Found error trace
[2022-04-15 10:18:21,447 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-04-15 10:18:21,475 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0
[2022-04-15 10:18:21,662 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2
[2022-04-15 10:18:21,662 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2022-04-15 10:18:21,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-04-15 10:18:21,663 INFO L85 PathProgramCache]: Analyzing trace with hash -1019533657, now seen corresponding path program 1 times
[2022-04-15 10:18:21,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION
[2022-04-15 10:18:21,663 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [464062397]
[2022-04-15 10:18:21,663 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation
[2022-04-15 10:18:21,663 INFO L85 PathProgramCache]: Analyzing trace with hash -1019533657, now seen corresponding path program 2 times
[2022-04-15 10:18:21,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-04-15 10:18:21,664 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1765539841]
[2022-04-15 10:18:21,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-04-15 10:18:21,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-04-15 10:18:21,679 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic
[2022-04-15 10:18:21,687 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1696657485]
[2022-04-15 10:18:21,687 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2022-04-15 10:18:21,687 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2022-04-15 10:18:21,688 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2022-04-15 10:18:21,689 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2022-04-15 10:18:21,707 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process
[2022-04-15 10:18:21,734 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2022-04-15 10:18:21,735 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat
[2022-04-15 10:18:21,735 INFO L263 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 10 conjunts are in the unsatisfiable core
[2022-04-15 10:18:21,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-15 10:18:21,745 INFO L286 TraceCheckSpWp]: Computing forward predicates...
[2022-04-15 10:18:21,939 INFO L272 TraceCheckUtils]: 0: Hoare triple {790#true} call ULTIMATE.init(); {790#true} is VALID
[2022-04-15 10:18:21,940 INFO L290 TraceCheckUtils]: 1: Hoare triple {790#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {790#true} is VALID
[2022-04-15 10:18:21,941 INFO L290 TraceCheckUtils]: 2: Hoare triple {790#true} assume true; {790#true} is VALID
[2022-04-15 10:18:21,941 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {790#true} {790#true} #67#return; {790#true} is VALID
[2022-04-15 10:18:21,942 INFO L272 TraceCheckUtils]: 4: Hoare triple {790#true} call #t~ret7 := main(); {790#true} is VALID
[2022-04-15 10:18:21,942 INFO L290 TraceCheckUtils]: 5: Hoare triple {790#true} havoc ~x1~0;havoc ~x2~0;havoc ~y1~0;havoc ~y2~0;havoc ~y3~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x1~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~x2~0 := #t~nondet5;havoc #t~nondet5; {790#true} is VALID
[2022-04-15 10:18:21,942 INFO L272 TraceCheckUtils]: 6: Hoare triple {790#true} call assume_abort_if_not((if ~x1~0 >= 0 then 1 else 0)); {790#true} is VALID
[2022-04-15 10:18:21,942 INFO L290 TraceCheckUtils]: 7: Hoare triple {790#true} ~cond := #in~cond; {790#true} is VALID
[2022-04-15 10:18:21,942 INFO L290 TraceCheckUtils]: 8: Hoare triple {790#true} assume !(0 == ~cond); {790#true} is VALID
[2022-04-15 10:18:21,942 INFO L290 TraceCheckUtils]: 9: Hoare triple {790#true} assume true; {790#true} is VALID
[2022-04-15 10:18:21,942 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {790#true} {790#true} #59#return; {790#true} is VALID
[2022-04-15 10:18:21,943 INFO L272 TraceCheckUtils]: 11: Hoare triple {790#true} call assume_abort_if_not((if 0 != ~x2~0 then 1 else 0)); {790#true} is VALID
[2022-04-15 10:18:21,943 INFO L290 TraceCheckUtils]: 12: Hoare triple {790#true} ~cond := #in~cond; {790#true} is VALID
[2022-04-15 10:18:21,943 INFO L290 TraceCheckUtils]: 13: Hoare triple {790#true} assume !(0 == ~cond); {790#true} is VALID
[2022-04-15 10:18:21,943 INFO L290 TraceCheckUtils]: 14: Hoare triple {790#true} assume true; {790#true} is VALID
[2022-04-15 10:18:21,943 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {790#true} {790#true} #61#return; {790#true} is VALID
[2022-04-15 10:18:21,943 INFO L290 TraceCheckUtils]: 16: Hoare triple {790#true} ~y1~0 := 0;~y2~0 := 0;~y3~0 := ~x1~0; {790#true} is VALID
[2022-04-15 10:18:21,944 INFO L290 TraceCheckUtils]: 17: Hoare triple {790#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {790#true} is VALID
[2022-04-15 10:18:21,944 INFO L290 TraceCheckUtils]: 18: Hoare triple {790#true} assume !!(#t~post6 < 1);havoc #t~post6; {790#true} is VALID
[2022-04-15 10:18:21,944 INFO L272 TraceCheckUtils]: 19: Hoare triple {790#true} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {790#true} is VALID
[2022-04-15 10:18:21,944 INFO L290 TraceCheckUtils]: 20: Hoare triple {790#true} ~cond := #in~cond; {855#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID
[2022-04-15 10:18:21,947 INFO L290 TraceCheckUtils]: 21: Hoare triple {855#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {859#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID
[2022-04-15 10:18:21,947 INFO L290 TraceCheckUtils]: 22: Hoare triple {859#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {859#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID
[2022-04-15 10:18:21,948 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {859#(not (= |__VERIFIER_assert_#in~cond| 0))} {790#true} #63#return; {866#(= (+ (* main_~x2~0 main_~y1~0) main_~y3~0 main_~y2~0) main_~x1~0)} is VALID
[2022-04-15 10:18:21,949 INFO L290 TraceCheckUtils]: 24: Hoare triple {866#(= (+ (* main_~x2~0 main_~y1~0) main_~y3~0 main_~y2~0) main_~x1~0)} assume !(0 != ~y3~0); {870#(= (+ (* main_~x2~0 main_~y1~0) main_~y2~0) main_~x1~0)} is VALID
[2022-04-15 10:18:21,949 INFO L272 TraceCheckUtils]: 25: Hoare triple {870#(= (+ (* main_~x2~0 main_~y1~0) main_~y2~0) main_~x1~0)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 == ~x1~0 then 1 else 0)); {874#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID
[2022-04-15 10:18:21,950 INFO L290 TraceCheckUtils]: 26: Hoare triple {874#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {878#(<= 1 __VERIFIER_assert_~cond)} is VALID
[2022-04-15 10:18:21,950 INFO L290 TraceCheckUtils]: 27: Hoare triple {878#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {791#false} is VALID
[2022-04-15 10:18:21,951 INFO L290 TraceCheckUtils]: 28: Hoare triple {791#false} assume !false; {791#false} is VALID
[2022-04-15 10:18:21,951 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked.
[2022-04-15 10:18:21,952 INFO L328 TraceCheckSpWp]: Computing backward predicates...
[2022-04-15 10:18:30,296 INFO L290 TraceCheckUtils]: 28: Hoare triple {791#false} assume !false; {791#false} is VALID
[2022-04-15 10:18:30,297 INFO L290 TraceCheckUtils]: 27: Hoare triple {878#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {791#false} is VALID
[2022-04-15 10:18:30,297 INFO L290 TraceCheckUtils]: 26: Hoare triple {874#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {878#(<= 1 __VERIFIER_assert_~cond)} is VALID
[2022-04-15 10:18:30,298 INFO L272 TraceCheckUtils]: 25: Hoare triple {870#(= (+ (* main_~x2~0 main_~y1~0) main_~y2~0) main_~x1~0)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 == ~x1~0 then 1 else 0)); {874#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID
[2022-04-15 10:18:30,299 INFO L290 TraceCheckUtils]: 24: Hoare triple {897#(or (not (= main_~y3~0 0)) (= (+ (* main_~x2~0 main_~y1~0) main_~y2~0) main_~x1~0))} assume !(0 != ~y3~0); {870#(= (+ (* main_~x2~0 main_~y1~0) main_~y2~0) main_~x1~0)} is VALID
[2022-04-15 10:18:30,300 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {859#(not (= |__VERIFIER_assert_#in~cond| 0))} {790#true} #63#return; {897#(or (not (= main_~y3~0 0)) (= (+ (* main_~x2~0 main_~y1~0) main_~y2~0) main_~x1~0))} is VALID
[2022-04-15 10:18:30,300 INFO L290 TraceCheckUtils]: 22: Hoare triple {859#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {859#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID
[2022-04-15 10:18:30,301 INFO L290 TraceCheckUtils]: 21: Hoare triple {910#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {859#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID
[2022-04-15 10:18:30,301 INFO L290 TraceCheckUtils]: 20: Hoare triple {790#true} ~cond := #in~cond; {910#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID
[2022-04-15 10:18:30,302 INFO L272 TraceCheckUtils]: 19: Hoare triple {790#true} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {790#true} is VALID
[2022-04-15 10:18:30,302 INFO L290 TraceCheckUtils]: 18: Hoare triple {790#true} assume !!(#t~post6 < 1);havoc #t~post6; {790#true} is VALID
[2022-04-15 10:18:30,302 INFO L290 TraceCheckUtils]: 17: Hoare triple {790#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {790#true} is VALID
[2022-04-15 10:18:30,302 INFO L290 TraceCheckUtils]: 16: Hoare triple {790#true} ~y1~0 := 0;~y2~0 := 0;~y3~0 := ~x1~0; {790#true} is VALID
[2022-04-15 10:18:30,302 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {790#true} {790#true} #61#return; {790#true} is VALID
[2022-04-15 10:18:30,302 INFO L290 TraceCheckUtils]: 14: Hoare triple {790#true} assume true; {790#true} is VALID
[2022-04-15 10:18:30,303 INFO L290 TraceCheckUtils]: 13: Hoare triple {790#true} assume !(0 == ~cond); {790#true} is VALID
[2022-04-15 10:18:30,303 INFO L290 TraceCheckUtils]: 12: Hoare triple {790#true} ~cond := #in~cond; {790#true} is VALID
[2022-04-15 10:18:30,303 INFO L272 TraceCheckUtils]: 11: Hoare triple {790#true} call assume_abort_if_not((if 0 != ~x2~0 then 1 else 0)); {790#true} is VALID
[2022-04-15 10:18:30,303 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {790#true} {790#true} #59#return; {790#true} is VALID
[2022-04-15 10:18:30,325 INFO L290 TraceCheckUtils]: 9: Hoare triple {790#true} assume true; {790#true} is VALID
[2022-04-15 10:18:30,325 INFO L290 TraceCheckUtils]: 8: Hoare triple {790#true} assume !(0 == ~cond); {790#true} is VALID
[2022-04-15 10:18:30,325 INFO L290 TraceCheckUtils]: 7: Hoare triple {790#true} ~cond := #in~cond; {790#true} is VALID
[2022-04-15 10:18:30,325 INFO L272 TraceCheckUtils]: 6: Hoare triple {790#true} call assume_abort_if_not((if ~x1~0 >= 0 then 1 else 0)); {790#true} is VALID
[2022-04-15 10:18:30,326 INFO L290 TraceCheckUtils]: 5: Hoare triple {790#true} havoc ~x1~0;havoc ~x2~0;havoc ~y1~0;havoc ~y2~0;havoc ~y3~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x1~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~x2~0 := #t~nondet5;havoc #t~nondet5; {790#true} is VALID
[2022-04-15 10:18:30,326 INFO L272 TraceCheckUtils]: 4: Hoare triple {790#true} call #t~ret7 := main(); {790#true} is VALID
[2022-04-15 10:18:30,326 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {790#true} {790#true} #67#return; {790#true} is VALID
[2022-04-15 10:18:30,326 INFO L290 TraceCheckUtils]: 2: Hoare triple {790#true} assume true; {790#true} is VALID
[2022-04-15 10:18:30,326 INFO L290 TraceCheckUtils]: 1: Hoare triple {790#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {790#true} is VALID
[2022-04-15 10:18:30,326 INFO L272 TraceCheckUtils]: 0: Hoare triple {790#true} call ULTIMATE.init(); {790#true} is VALID
[2022-04-15 10:18:30,327 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked.
[2022-04-15 10:18:30,327 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-04-15 10:18:30,327 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1765539841]
[2022-04-15 10:18:30,327 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT
[2022-04-15 10:18:30,327 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1696657485]
[2022-04-15 10:18:30,327 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1696657485] provided 0 perfect and 2 imperfect interpolant sequences
[2022-04-15 10:18:30,327 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences.
[2022-04-15 10:18:30,327 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 10
[2022-04-15 10:18:30,328 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace
[2022-04-15 10:18:30,328 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [464062397]
[2022-04-15 10:18:30,328 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [464062397] provided 1 perfect and 0 imperfect interpolant sequences
[2022-04-15 10:18:30,328 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-04-15 10:18:30,328 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2022-04-15 10:18:30,328 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [707419787]
[2022-04-15 10:18:30,328 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-04-15 10:18:30,329 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 6 states have internal predecessors, (16), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 29
[2022-04-15 10:18:30,329 INFO L84 Accepts]: Finished accepts. word is accepted.
[2022-04-15 10:18:30,329 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 6 states have internal predecessors, (16), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4)
[2022-04-15 10:18:30,349 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-15 10:18:30,349 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2022-04-15 10:18:30,349 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION
[2022-04-15 10:18:30,350 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2022-04-15 10:18:30,350 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90
[2022-04-15 10:18:30,350 INFO L87 Difference]: Start difference. First operand 32 states and 36 transitions. Second operand has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 6 states have internal predecessors, (16), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4)
[2022-04-15 10:18:30,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-15 10:18:30,559 INFO L93 Difference]: Finished difference Result 39 states and 42 transitions.
[2022-04-15 10:18:30,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states.
[2022-04-15 10:18:30,559 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 6 states have internal predecessors, (16), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 29
[2022-04-15 10:18:30,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-04-15 10:18:30,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 6 states have internal predecessors, (16), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4)
[2022-04-15 10:18:30,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 35 transitions.
[2022-04-15 10:18:30,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 6 states have internal predecessors, (16), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4)
[2022-04-15 10:18:30,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 35 transitions.
[2022-04-15 10:18:30,563 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 35 transitions.
[2022-04-15 10:18:30,593 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-15 10:18:30,594 INFO L225 Difference]: With dead ends: 39
[2022-04-15 10:18:30,594 INFO L226 Difference]: Without dead ends: 34
[2022-04-15 10:18:30,595 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 48 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156
[2022-04-15 10:18:30,595 INFO L913 BasicCegarLoop]: 21 mSDtfsCounter, 17 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 103 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2022-04-15 10:18:30,596 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [17 Valid, 103 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2022-04-15 10:18:30,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states.
[2022-04-15 10:18:30,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 29.
[2022-04-15 10:18:30,611 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa
[2022-04-15 10:18:30,611 INFO L82 GeneralOperation]: Start isEquivalent. First operand 34 states. Second operand has 29 states, 19 states have (on average 1.105263157894737) internal successors, (21), 19 states have internal predecessors, (21), 6 states have call successors, (6), 5 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4)
[2022-04-15 10:18:30,611 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand has 29 states, 19 states have (on average 1.105263157894737) internal successors, (21), 19 states have internal predecessors, (21), 6 states have call successors, (6), 5 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4)
[2022-04-15 10:18:30,612 INFO L87 Difference]: Start difference. First operand 34 states. Second operand has 29 states, 19 states have (on average 1.105263157894737) internal successors, (21), 19 states have internal predecessors, (21), 6 states have call successors, (6), 5 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4)
[2022-04-15 10:18:30,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-15 10:18:30,613 INFO L93 Difference]: Finished difference Result 34 states and 36 transitions.
[2022-04-15 10:18:30,613 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 36 transitions.
[2022-04-15 10:18:30,614 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-15 10:18:30,614 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-15 10:18:30,614 INFO L74 IsIncluded]: Start isIncluded. First operand has 29 states, 19 states have (on average 1.105263157894737) internal successors, (21), 19 states have internal predecessors, (21), 6 states have call successors, (6), 5 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 34 states.
[2022-04-15 10:18:30,614 INFO L87 Difference]: Start difference. First operand has 29 states, 19 states have (on average 1.105263157894737) internal successors, (21), 19 states have internal predecessors, (21), 6 states have call successors, (6), 5 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 34 states.
[2022-04-15 10:18:30,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-15 10:18:30,616 INFO L93 Difference]: Finished difference Result 34 states and 36 transitions.
[2022-04-15 10:18:30,616 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 36 transitions.
[2022-04-15 10:18:30,616 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-15 10:18:30,616 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-15 10:18:30,616 INFO L88 GeneralOperation]: Finished isEquivalent.
[2022-04-15 10:18:30,616 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa
[2022-04-15 10:18:30,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 19 states have (on average 1.105263157894737) internal successors, (21), 19 states have internal predecessors, (21), 6 states have call successors, (6), 5 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4)
[2022-04-15 10:18:30,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 31 transitions.
[2022-04-15 10:18:30,618 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 31 transitions. Word has length 29
[2022-04-15 10:18:30,618 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-04-15 10:18:30,618 INFO L478 AbstractCegarLoop]: Abstraction has 29 states and 31 transitions.
[2022-04-15 10:18:30,618 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 6 states have internal predecessors, (16), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4)
[2022-04-15 10:18:30,618 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 29 states and 31 transitions.
[2022-04-15 10:18:30,653 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-15 10:18:30,654 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 31 transitions.
[2022-04-15 10:18:30,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33
[2022-04-15 10:18:30,654 INFO L491 BasicCegarLoop]: Found error trace
[2022-04-15 10:18:30,654 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-04-15 10:18:30,682 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0
[2022-04-15 10:18:30,867 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2022-04-15 10:18:30,867 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2022-04-15 10:18:30,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-04-15 10:18:30,868 INFO L85 PathProgramCache]: Analyzing trace with hash 1080225052, now seen corresponding path program 1 times
[2022-04-15 10:18:30,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION
[2022-04-15 10:18:30,868 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [270222348]
[2022-04-15 10:18:30,869 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation
[2022-04-15 10:18:30,869 INFO L85 PathProgramCache]: Analyzing trace with hash 1080225052, now seen corresponding path program 2 times
[2022-04-15 10:18:30,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-04-15 10:18:30,869 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [571755547]
[2022-04-15 10:18:30,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-04-15 10:18:30,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-04-15 10:18:30,883 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic
[2022-04-15 10:18:30,884 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [109063028]
[2022-04-15 10:18:30,884 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2022-04-15 10:18:30,884 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2022-04-15 10:18:30,884 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2022-04-15 10:18:30,885 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2022-04-15 10:18:30,918 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process
[2022-04-15 10:18:30,946 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2022-04-15 10:18:30,947 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat
[2022-04-15 10:18:30,947 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2022-04-15 10:18:30,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2022-04-15 10:18:30,993 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2022-04-15 10:18:30,993 INFO L130 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found a feasible trace
[2022-04-15 10:18:30,993 INFO L618 BasicCegarLoop]: Counterexample is feasible
[2022-04-15 10:18:30,995 INFO L788 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining)
[2022-04-15 10:18:31,055 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0
[2022-04-15 10:18:31,229 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2022-04-15 10:18:31,233 INFO L719 BasicCegarLoop]: Path program histogram: [2, 2, 2, 2, 2]
[2022-04-15 10:18:31,235 INFO L177 ceAbstractionStarter]: Computing trace abstraction results
[2022-04-15 10:18:31,245 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation
[2022-04-15 10:18:31,245 WARN L170 areAnnotationChecker]: ULTIMATE.initENTRY has no Hoare annotation
[2022-04-15 10:18:31,245 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation
[2022-04-15 10:18:31,245 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation
[2022-04-15 10:18:31,245 WARN L170 areAnnotationChecker]: assume_abort_if_notENTRY has no Hoare annotation
[2022-04-15 10:18:31,245 WARN L170 areAnnotationChecker]: mainENTRY has no Hoare annotation
[2022-04-15 10:18:31,245 WARN L170 areAnnotationChecker]: __VERIFIER_assertENTRY has no Hoare annotation
[2022-04-15 10:18:31,245 WARN L170 areAnnotationChecker]: reach_errorFINAL has no Hoare annotation
[2022-04-15 10:18:31,245 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation
[2022-04-15 10:18:31,245 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation
[2022-04-15 10:18:31,246 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation
[2022-04-15 10:18:31,246 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation
[2022-04-15 10:18:31,246 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation
[2022-04-15 10:18:31,246 WARN L170 areAnnotationChecker]: L29 has no Hoare annotation
[2022-04-15 10:18:31,246 WARN L170 areAnnotationChecker]: L29 has no Hoare annotation
[2022-04-15 10:18:31,246 WARN L170 areAnnotationChecker]: L16 has no Hoare annotation
[2022-04-15 10:18:31,246 WARN L170 areAnnotationChecker]: L16 has no Hoare annotation
[2022-04-15 10:18:31,246 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation
[2022-04-15 10:18:31,246 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation
[2022-04-15 10:18:31,246 WARN L170 areAnnotationChecker]: L13-2 has no Hoare annotation
[2022-04-15 10:18:31,246 WARN L170 areAnnotationChecker]: L29-1 has no Hoare annotation
[2022-04-15 10:18:31,246 WARN L170 areAnnotationChecker]: L29-1 has no Hoare annotation
[2022-04-15 10:18:31,246 WARN L170 areAnnotationChecker]: L17 has no Hoare annotation
[2022-04-15 10:18:31,246 WARN L170 areAnnotationChecker]: L17 has no Hoare annotation
[2022-04-15 10:18:31,246 WARN L170 areAnnotationChecker]: L16-2 has no Hoare annotation
[2022-04-15 10:18:31,246 WARN L170 areAnnotationChecker]: assume_abort_if_notEXIT has no Hoare annotation
[2022-04-15 10:18:31,246 WARN L170 areAnnotationChecker]: assume_abort_if_notEXIT has no Hoare annotation
[2022-04-15 10:18:31,246 WARN L170 areAnnotationChecker]: L30 has no Hoare annotation
[2022-04-15 10:18:31,246 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation
[2022-04-15 10:18:31,247 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation
[2022-04-15 10:18:31,247 WARN L170 areAnnotationChecker]: L41-2 has no Hoare annotation
[2022-04-15 10:18:31,247 WARN L170 areAnnotationChecker]: L41-2 has no Hoare annotation
[2022-04-15 10:18:31,247 WARN L170 areAnnotationChecker]: L37-1 has no Hoare annotation
[2022-04-15 10:18:31,247 WARN L170 areAnnotationChecker]: L37-1 has no Hoare annotation
[2022-04-15 10:18:31,247 WARN L170 areAnnotationChecker]: L50 has no Hoare annotation
[2022-04-15 10:18:31,247 WARN L170 areAnnotationChecker]: L36-3 has no Hoare annotation
[2022-04-15 10:18:31,247 WARN L170 areAnnotationChecker]: L36-3 has no Hoare annotation
[2022-04-15 10:18:31,247 WARN L170 areAnnotationChecker]: L36-1 has no Hoare annotation
[2022-04-15 10:18:31,247 WARN L170 areAnnotationChecker]: L36-1 has no Hoare annotation
[2022-04-15 10:18:31,247 WARN L170 areAnnotationChecker]: L41 has no Hoare annotation
[2022-04-15 10:18:31,247 WARN L170 areAnnotationChecker]: L41 has no Hoare annotation
[2022-04-15 10:18:31,247 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation
[2022-04-15 10:18:31,247 WARN L170 areAnnotationChecker]: L37 has no Hoare annotation
[2022-04-15 10:18:31,247 WARN L170 areAnnotationChecker]: L37 has no Hoare annotation
[2022-04-15 10:18:31,247 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation
[2022-04-15 10:18:31,247 INFO L163 areAnnotationChecker]: CFG has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing.
[2022-04-15 10:18:31,248 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.04 10:18:31 BoogieIcfgContainer
[2022-04-15 10:18:31,248 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2022-04-15 10:18:31,249 INFO L158 Benchmark]: Toolchain (without parser) took 12250.93ms. Allocated memory was 182.5MB in the beginning and 230.7MB in the end (delta: 48.2MB). Free memory was 132.6MB in the beginning and 167.4MB in the end (delta: -34.8MB). Peak memory consumption was 13.3MB. Max. memory is 8.0GB.
[2022-04-15 10:18:31,250 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 182.5MB. Free memory is still 148.8MB. There was no memory consumed. Max. memory is 8.0GB.
[2022-04-15 10:18:31,250 INFO L158 Benchmark]: CACSL2BoogieTranslator took 201.33ms. Allocated memory is still 182.5MB. Free memory was 132.4MB in the beginning and 158.4MB in the end (delta: -26.0MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB.
[2022-04-15 10:18:31,250 INFO L158 Benchmark]: Boogie Preprocessor took 24.20ms. Allocated memory is still 182.5MB. Free memory was 158.4MB in the beginning and 156.8MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB.
[2022-04-15 10:18:31,250 INFO L158 Benchmark]: RCFGBuilder took 224.56ms. Allocated memory is still 182.5MB. Free memory was 156.8MB in the beginning and 146.3MB in the end (delta: 10.4MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB.
[2022-04-15 10:18:31,251 INFO L158 Benchmark]: TraceAbstraction took 11795.86ms. Allocated memory was 182.5MB in the beginning and 230.7MB in the end (delta: 48.2MB). Free memory was 145.6MB in the beginning and 167.4MB in the end (delta: -21.8MB). Peak memory consumption was 27.5MB. Max. memory is 8.0GB.
[2022-04-15 10:18:31,252 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] #######################
--- Results ---
* Results from de.uni_freiburg.informatik.ultimate.core:
- AssertionsEnabledResult: Assertions are enabled
Assertions are enabled
- StatisticsResult: Toolchain Benchmarks
Benchmark results are:
* CDTParser took 0.11ms. Allocated memory is still 182.5MB. Free memory is still 148.8MB. There was no memory consumed. Max. memory is 8.0GB.
* CACSL2BoogieTranslator took 201.33ms. Allocated memory is still 182.5MB. Free memory was 132.4MB in the beginning and 158.4MB in the end (delta: -26.0MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB.
* Boogie Preprocessor took 24.20ms. Allocated memory is still 182.5MB. Free memory was 158.4MB in the beginning and 156.8MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB.
* RCFGBuilder took 224.56ms. Allocated memory is still 182.5MB. Free memory was 156.8MB in the beginning and 146.3MB in the end (delta: 10.4MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB.
* TraceAbstraction took 11795.86ms. Allocated memory was 182.5MB in the beginning and 230.7MB in the end (delta: 48.2MB). Free memory was 145.6MB in the beginning and 167.4MB in the end (delta: -21.8MB). Peak memory consumption was 27.5MB. Max. memory is 8.0GB.
* Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction:
- StatisticsResult: ErrorAutomatonStatistics
NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0
- CounterExampleResult [Line: 18]: a call to reach_error is reachable
a call to reach_error is reachable
We found a FailurePath:
[L22] int counter = 0;
[L24] int x1, x2;
[L25] int y1, y2, y3;
[L26] x1 = __VERIFIER_nondet_int()
[L27] x2 = __VERIFIER_nondet_int()
[L29] CALL assume_abort_if_not(x1 >= 0)
[L13] COND FALSE !(!cond)
[L29] RET assume_abort_if_not(x1 >= 0)
[L30] CALL assume_abort_if_not(x2 != 0)
[L13] COND FALSE !(!cond)
[L30] RET assume_abort_if_not(x2 != 0)
[L32] y1 = 0
[L33] y2 = 0
[L34] y3 = x1
[L36] EXPR counter++
[L36] COND TRUE counter++<1
[L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1)
[L16] COND FALSE !(!(cond))
[L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1)
[L39] COND FALSE !(!(y3 != 0))
[L41] COND TRUE y2 + 1 == x2
[L42] y1 = y1 + 1
[L43] y2 = 0
[L44] y3 = y3 - 1
[L36] EXPR counter++
[L36] COND FALSE !(counter++<1)
[L50] CALL __VERIFIER_assert(y1*x2 + y2 == x1)
[L16] COND TRUE !(cond)
[L18] reach_error()
- StatisticsResult: Ultimate Automizer benchmark data
CFG has 6 procedures, 33 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 11.7s, OverallIterations: 5, TraceHistogramMax: 2, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 0.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 37 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 34 mSDsluCounter, 288 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 186 mSDsCounter, 11 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 112 IncrementalHoareTripleChecker+Invalid, 123 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 11 mSolverCounterUnsat, 102 mSDtfsCounter, 112 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 115 GetRequests, 96 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=32occurred in iteration=3, InterpolantAutomatonStates: 20, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 4 MinimizatonAttempts, 9 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: No data available, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available
RESULT: Ultimate proved your program to be incorrect!
[2022-04-15 10:18:31,276 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0
Received shutdown request...