/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/nla-digbench-scaling/bresenham-ll_unwindbound100.c -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-25 00:40:21,609 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-25 00:40:21,682 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf [2023-12-25 00:40:21,685 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-25 00:40:21,685 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-25 00:40:21,699 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-25 00:40:21,700 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-25 00:40:21,700 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-25 00:40:21,700 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-25 00:40:21,700 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-25 00:40:21,701 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-25 00:40:21,701 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-25 00:40:21,701 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-25 00:40:21,701 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-25 00:40:21,702 INFO L153 SettingsManager]: * Use SBE=true [2023-12-25 00:40:21,702 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-25 00:40:21,702 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-25 00:40:21,702 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-25 00:40:21,703 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-25 00:40:21,703 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-25 00:40:21,703 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-25 00:40:21,706 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-25 00:40:21,706 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-25 00:40:21,706 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-12-25 00:40:21,709 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-12-25 00:40:21,709 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-25 00:40:21,709 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-12-25 00:40:21,709 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-25 00:40:21,710 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-25 00:40:21,710 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-25 00:40:21,710 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-25 00:40:21,711 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-25 00:40:21,711 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-25 00:40:21,711 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-25 00:40:21,711 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-25 00:40:21,711 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-25 00:40:21,711 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-25 00:40:21,711 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-25 00:40:21,711 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-12-25 00:40:21,711 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-12-25 00:40:21,712 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-25 00:40:21,712 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-25 00:40:21,712 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-25 00:40:21,712 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-25 00:40:21,712 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-25 00:40:21,712 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-12-25 00:40:21,712 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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 [2023-12-25 00:40:21,878 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-25 00:40:21,903 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-25 00:40:21,905 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-25 00:40:21,906 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-25 00:40:21,907 INFO L274 PluginConnector]: CDTParser initialized [2023-12-25 00:40:21,908 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/bresenham-ll_unwindbound100.c [2023-12-25 00:40:22,959 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-25 00:40:23,097 INFO L384 CDTParser]: Found 1 translation units. [2023-12-25 00:40:23,098 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/bresenham-ll_unwindbound100.c [2023-12-25 00:40:23,103 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3e120bc0e/fef403d1d8dd4d9b913fe8d39b6ee14f/FLAG3a5c88062 [2023-12-25 00:40:23,113 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3e120bc0e/fef403d1d8dd4d9b913fe8d39b6ee14f [2023-12-25 00:40:23,115 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-25 00:40:23,116 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-25 00:40:23,119 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-25 00:40:23,119 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-25 00:40:23,123 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-25 00:40:23,123 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.12 12:40:23" (1/1) ... [2023-12-25 00:40:23,124 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@54d7a1f2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 12:40:23, skipping insertion in model container [2023-12-25 00:40:23,124 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.12 12:40:23" (1/1) ... [2023-12-25 00:40:23,141 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-25 00:40:23,237 WARN L239 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/bresenham-ll_unwindbound100.c[597,610] [2023-12-25 00:40:23,250 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-25 00:40:23,257 INFO L202 MainTranslator]: Completed pre-run [2023-12-25 00:40:23,265 WARN L239 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/bresenham-ll_unwindbound100.c[597,610] [2023-12-25 00:40:23,271 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-25 00:40:23,280 INFO L206 MainTranslator]: Completed translation [2023-12-25 00:40:23,280 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 12:40:23 WrapperNode [2023-12-25 00:40:23,280 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-25 00:40:23,281 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-25 00:40:23,281 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-25 00:40:23,281 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-25 00:40:23,286 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 12:40:23" (1/1) ... [2023-12-25 00:40:23,298 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 12:40:23" (1/1) ... [2023-12-25 00:40:23,315 INFO L138 Inliner]: procedures = 14, calls = 9, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 53 [2023-12-25 00:40:23,316 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-25 00:40:23,316 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-25 00:40:23,316 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-25 00:40:23,316 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-25 00:40:23,323 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 12:40:23" (1/1) ... [2023-12-25 00:40:23,323 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 12:40:23" (1/1) ... [2023-12-25 00:40:23,334 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 12:40:23" (1/1) ... [2023-12-25 00:40:23,348 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2023-12-25 00:40:23,348 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 12:40:23" (1/1) ... [2023-12-25 00:40:23,349 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 12:40:23" (1/1) ... [2023-12-25 00:40:23,357 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 12:40:23" (1/1) ... [2023-12-25 00:40:23,359 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 12:40:23" (1/1) ... [2023-12-25 00:40:23,360 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 12:40:23" (1/1) ... [2023-12-25 00:40:23,361 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 12:40:23" (1/1) ... [2023-12-25 00:40:23,362 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-25 00:40:23,362 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-25 00:40:23,362 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-25 00:40:23,363 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-25 00:40:23,363 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 12:40:23" (1/1) ... [2023-12-25 00:40:23,382 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-25 00:40:23,390 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-25 00:40:23,402 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-12-25 00:40:23,412 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-12-25 00:40:23,445 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-25 00:40:23,445 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-12-25 00:40:23,445 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-25 00:40:23,446 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-25 00:40:23,446 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2023-12-25 00:40:23,446 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2023-12-25 00:40:23,489 INFO L241 CfgBuilder]: Building ICFG [2023-12-25 00:40:23,491 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-25 00:40:23,923 INFO L282 CfgBuilder]: Performing block encoding [2023-12-25 00:40:23,945 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-25 00:40:23,945 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-25 00:40:23,945 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.12 12:40:23 BoogieIcfgContainer [2023-12-25 00:40:23,945 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-25 00:40:23,947 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-25 00:40:23,947 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-25 00:40:23,953 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-25 00:40:23,954 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.12 12:40:23" (1/3) ... [2023-12-25 00:40:23,954 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6cf47f26 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.12 12:40:23, skipping insertion in model container [2023-12-25 00:40:23,954 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 12:40:23" (2/3) ... [2023-12-25 00:40:23,955 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6cf47f26 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.12 12:40:23, skipping insertion in model container [2023-12-25 00:40:23,955 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.12 12:40:23" (3/3) ... [2023-12-25 00:40:23,956 INFO L112 eAbstractionObserver]: Analyzing ICFG bresenham-ll_unwindbound100.c [2023-12-25 00:40:23,968 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-25 00:40:23,968 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-25 00:40:23,995 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-25 00:40:24,000 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, 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, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@13674f46, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-25 00:40:24,000 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-25 00:40:24,002 INFO L276 IsEmpty]: Start isEmpty. Operand has 17 states, 12 states have (on average 1.5) internal successors, (18), 13 states have internal predecessors, (18), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-25 00:40:24,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2023-12-25 00:40:24,007 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 00:40:24,007 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-12-25 00:40:24,007 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 00:40:24,011 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 00:40:24,011 INFO L85 PathProgramCache]: Analyzing trace with hash -26250642, now seen corresponding path program 1 times [2023-12-25 00:40:24,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 00:40:24,019 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1199360766] [2023-12-25 00:40:24,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 00:40:24,019 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 00:40:24,019 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 00:40:24,021 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 00:40:24,022 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2023-12-25 00:40:24,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 00:40:24,208 INFO L262 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 8 conjunts are in the unsatisfiable core [2023-12-25 00:40:24,212 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 00:40:24,547 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 00:40:24,548 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 00:40:24,548 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 00:40:24,548 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1199360766] [2023-12-25 00:40:24,549 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1199360766] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 00:40:24,549 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 00:40:24,549 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-25 00:40:24,550 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [460171624] [2023-12-25 00:40:24,550 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 00:40:24,560 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-25 00:40:24,561 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 00:40:24,589 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-25 00:40:24,589 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-12-25 00:40:24,591 INFO L87 Difference]: Start difference. First operand has 17 states, 12 states have (on average 1.5) internal successors, (18), 13 states have internal predecessors, (18), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 6 states, 5 states have (on average 1.2) internal successors, (6), 4 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 00:40:25,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 00:40:25,728 INFO L93 Difference]: Finished difference Result 46 states and 66 transitions. [2023-12-25 00:40:25,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-25 00:40:25,730 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.2) internal successors, (6), 4 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2023-12-25 00:40:25,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 00:40:25,735 INFO L225 Difference]: With dead ends: 46 [2023-12-25 00:40:25,735 INFO L226 Difference]: Without dead ends: 24 [2023-12-25 00:40:25,737 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-12-25 00:40:25,739 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 12 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2023-12-25 00:40:25,740 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 41 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2023-12-25 00:40:25,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2023-12-25 00:40:25,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 23. [2023-12-25 00:40:25,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 18 states have internal predecessors, (21), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-25 00:40:25,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 26 transitions. [2023-12-25 00:40:25,763 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 26 transitions. Word has length 7 [2023-12-25 00:40:25,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 00:40:25,763 INFO L495 AbstractCegarLoop]: Abstraction has 23 states and 26 transitions. [2023-12-25 00:40:25,763 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.2) internal successors, (6), 4 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 00:40:25,763 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 26 transitions. [2023-12-25 00:40:25,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-12-25 00:40:25,764 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 00:40:25,764 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 00:40:25,769 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2023-12-25 00:40:25,969 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 00:40:25,969 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 00:40:25,970 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 00:40:25,970 INFO L85 PathProgramCache]: Analyzing trace with hash -479331439, now seen corresponding path program 1 times [2023-12-25 00:40:25,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 00:40:25,971 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1385357600] [2023-12-25 00:40:25,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 00:40:25,971 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 00:40:25,971 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 00:40:25,972 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 00:40:25,973 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2023-12-25 00:40:28,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 00:40:28,614 INFO L262 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 17 conjunts are in the unsatisfiable core [2023-12-25 00:40:28,616 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 00:40:30,011 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 00:40:30,011 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 00:40:56,580 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 00:40:56,581 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 00:40:56,581 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1385357600] [2023-12-25 00:40:56,581 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1385357600] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 00:40:56,581 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 00:40:56,581 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 20 [2023-12-25 00:40:56,581 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1743750049] [2023-12-25 00:40:56,581 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 00:40:56,582 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2023-12-25 00:40:56,582 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 00:40:56,583 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2023-12-25 00:40:56,585 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=311, Unknown=0, NotChecked=0, Total=380 [2023-12-25 00:40:56,585 INFO L87 Difference]: Start difference. First operand 23 states and 26 transitions. Second operand has 20 states, 16 states have (on average 1.625) internal successors, (26), 18 states have internal predecessors, (26), 4 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-25 00:41:04,004 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 00:41:06,590 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.04s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 00:41:09,673 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.38s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 00:41:27,817 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 00:41:29,801 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.59s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 00:41:33,886 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.85s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 00:41:44,374 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.08s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 00:41:44,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 00:41:44,374 INFO L93 Difference]: Finished difference Result 50 states and 61 transitions. [2023-12-25 00:41:44,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-12-25 00:41:44,402 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 16 states have (on average 1.625) internal successors, (26), 18 states have internal predecessors, (26), 4 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 17 [2023-12-25 00:41:44,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 00:41:44,403 INFO L225 Difference]: With dead ends: 50 [2023-12-25 00:41:44,403 INFO L226 Difference]: Without dead ends: 45 [2023-12-25 00:41:44,403 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 128 ImplicationChecksByTransitivity, 41.7s TimeCoverageRelationStatistics Valid=143, Invalid=669, Unknown=0, NotChecked=0, Total=812 [2023-12-25 00:41:44,404 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 45 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 204 mSolverCounterSat, 21 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 28.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 228 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 204 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 29.0s IncrementalHoareTripleChecker+Time [2023-12-25 00:41:44,404 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 79 Invalid, 228 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 204 Invalid, 3 Unknown, 0 Unchecked, 29.0s Time] [2023-12-25 00:41:44,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2023-12-25 00:41:44,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 37. [2023-12-25 00:41:44,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 28 states have (on average 1.2142857142857142) internal successors, (34), 30 states have internal predecessors, (34), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2023-12-25 00:41:44,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 43 transitions. [2023-12-25 00:41:44,426 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 43 transitions. Word has length 17 [2023-12-25 00:41:44,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 00:41:44,427 INFO L495 AbstractCegarLoop]: Abstraction has 37 states and 43 transitions. [2023-12-25 00:41:44,427 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 16 states have (on average 1.625) internal successors, (26), 18 states have internal predecessors, (26), 4 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-25 00:41:44,427 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 43 transitions. [2023-12-25 00:41:44,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-12-25 00:41:44,428 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 00:41:44,428 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 00:41:44,439 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2023-12-25 00:41:44,628 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 00:41:44,629 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 00:41:44,629 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 00:41:44,629 INFO L85 PathProgramCache]: Analyzing trace with hash -1288678065, now seen corresponding path program 1 times [2023-12-25 00:41:44,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 00:41:44,630 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1802310147] [2023-12-25 00:41:44,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 00:41:44,630 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 00:41:44,630 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 00:41:44,632 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 00:41:44,633 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2023-12-25 00:42:20,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 00:42:20,479 INFO L262 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 18 conjunts are in the unsatisfiable core [2023-12-25 00:42:20,481 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 00:42:22,947 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 00:42:22,947 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 00:43:16,578 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 00:43:16,578 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 00:43:16,578 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1802310147] [2023-12-25 00:43:16,578 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1802310147] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 00:43:16,578 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 00:43:16,579 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 20 [2023-12-25 00:43:16,579 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1885196433] [2023-12-25 00:43:16,579 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 00:43:16,579 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2023-12-25 00:43:16,579 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 00:43:16,580 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2023-12-25 00:43:16,580 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=311, Unknown=6, NotChecked=0, Total=380 [2023-12-25 00:43:16,580 INFO L87 Difference]: Start difference. First operand 37 states and 43 transitions. Second operand has 20 states, 16 states have (on average 1.625) internal successors, (26), 18 states have internal predecessors, (26), 4 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-25 00:43:20,705 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.04s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 00:43:36,567 WARN L293 SmtUtils]: Spent 8.14s on a formula simplification. DAG size of input: 33 DAG size of output: 30 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-25 00:43:52,675 WARN L293 SmtUtils]: Spent 9.24s on a formula simplification. DAG size of input: 42 DAG size of output: 34 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-25 00:43:57,017 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.25s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 00:44:01,019 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 00:44:05,671 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 00:44:20,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 00:44:20,116 INFO L93 Difference]: Finished difference Result 63 states and 73 transitions. [2023-12-25 00:44:20,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-12-25 00:44:20,149 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 16 states have (on average 1.625) internal successors, (26), 18 states have internal predecessors, (26), 4 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 17 [2023-12-25 00:44:20,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 00:44:20,150 INFO L225 Difference]: With dead ends: 63 [2023-12-25 00:44:20,150 INFO L226 Difference]: Without dead ends: 59 [2023-12-25 00:44:20,151 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 134 ImplicationChecksByTransitivity, 91.9s TimeCoverageRelationStatistics Valid=143, Invalid=721, Unknown=6, NotChecked=0, Total=870 [2023-12-25 00:44:20,152 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 36 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 284 mSolverCounterSat, 14 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 20.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 103 SdHoareTripleChecker+Invalid, 300 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 284 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 21.2s IncrementalHoareTripleChecker+Time [2023-12-25 00:44:20,152 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 103 Invalid, 300 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 284 Invalid, 2 Unknown, 0 Unchecked, 21.2s Time] [2023-12-25 00:44:20,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2023-12-25 00:44:20,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 35. [2023-12-25 00:44:20,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 27 states have (on average 1.1481481481481481) internal successors, (31), 27 states have internal predecessors, (31), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-25 00:44:20,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 38 transitions. [2023-12-25 00:44:20,159 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 38 transitions. Word has length 17 [2023-12-25 00:44:20,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 00:44:20,159 INFO L495 AbstractCegarLoop]: Abstraction has 35 states and 38 transitions. [2023-12-25 00:44:20,159 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 16 states have (on average 1.625) internal successors, (26), 18 states have internal predecessors, (26), 4 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-25 00:44:20,160 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 38 transitions. [2023-12-25 00:44:20,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2023-12-25 00:44:20,161 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 00:44:20,161 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 00:44:20,215 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2023-12-25 00:44:20,376 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 00:44:20,377 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 00:44:20,377 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 00:44:20,377 INFO L85 PathProgramCache]: Analyzing trace with hash -1366888132, now seen corresponding path program 1 times [2023-12-25 00:44:20,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 00:44:20,377 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [9862996] [2023-12-25 00:44:20,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 00:44:20,377 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 00:44:20,378 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 00:44:20,379 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 00:44:20,380 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2023-12-25 00:44:20,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 00:44:20,526 INFO L262 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 5 conjunts are in the unsatisfiable core [2023-12-25 00:44:20,527 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 00:44:20,598 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 00:44:20,598 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 00:44:20,682 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 00:44:20,683 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 00:44:20,683 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [9862996] [2023-12-25 00:44:20,683 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [9862996] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 00:44:20,683 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 00:44:20,683 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5] total 8 [2023-12-25 00:44:20,683 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [741796546] [2023-12-25 00:44:20,683 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 00:44:20,684 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-25 00:44:20,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 00:44:20,684 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-25 00:44:20,684 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2023-12-25 00:44:20,684 INFO L87 Difference]: Start difference. First operand 35 states and 38 transitions. Second operand has 8 states, 8 states have (on average 3.25) internal successors, (26), 8 states have internal predecessors, (26), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-25 00:44:21,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 00:44:21,795 INFO L93 Difference]: Finished difference Result 76 states and 83 transitions. [2023-12-25 00:44:21,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-25 00:44:21,797 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.25) internal successors, (26), 8 states have internal predecessors, (26), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 18 [2023-12-25 00:44:21,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 00:44:21,798 INFO L225 Difference]: With dead ends: 76 [2023-12-25 00:44:21,798 INFO L226 Difference]: Without dead ends: 70 [2023-12-25 00:44:21,798 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2023-12-25 00:44:21,800 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 32 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2023-12-25 00:44:21,801 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 79 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2023-12-25 00:44:21,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2023-12-25 00:44:21,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 58. [2023-12-25 00:44:21,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 46 states have (on average 1.173913043478261) internal successors, (54), 46 states have internal predecessors, (54), 6 states have call successors, (6), 6 states have call predecessors, (6), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-12-25 00:44:21,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 65 transitions. [2023-12-25 00:44:21,816 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 65 transitions. Word has length 18 [2023-12-25 00:44:21,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 00:44:21,817 INFO L495 AbstractCegarLoop]: Abstraction has 58 states and 65 transitions. [2023-12-25 00:44:21,817 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.25) internal successors, (26), 8 states have internal predecessors, (26), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-25 00:44:21,817 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 65 transitions. [2023-12-25 00:44:21,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2023-12-25 00:44:21,817 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 00:44:21,817 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 00:44:21,826 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2023-12-25 00:44:22,018 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 00:44:22,018 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 00:44:22,019 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 00:44:22,019 INFO L85 PathProgramCache]: Analyzing trace with hash -382706270, now seen corresponding path program 1 times [2023-12-25 00:44:22,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 00:44:22,020 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [281946244] [2023-12-25 00:44:22,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 00:44:22,020 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 00:44:22,020 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 00:44:22,021 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 00:44:22,022 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2023-12-25 00:44:24,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 00:44:24,584 INFO L262 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 19 conjunts are in the unsatisfiable core [2023-12-25 00:44:24,586 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 00:44:28,192 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-25 00:44:28,192 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 00:45:52,307 WARN L293 SmtUtils]: Spent 8.13s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-25 00:46:01,469 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ sign_extend 32) |c_ULTIMATE.start_main_~X~0#1|))) (let ((.cse2 (bvneg .cse1)) (.cse7 ((_ sign_extend 32) |c_ULTIMATE.start_main_~Y~0#1|))) (let ((.cse3 (bvadd |c_ULTIMATE.start_main_~y~0#1| (_ bv1 64))) (.cse0 (bvadd |c_ULTIMATE.start_main_~x~0#1| (_ bv1 64))) (.cse4 (bvmul .cse7 (_ bv4 64))) (.cse5 (bvmul (_ bv2 64) (bvmul |c_ULTIMATE.start_main_~x~0#1| .cse7))) (.cse6 (bvneg (bvadd (bvmul (_ bv2 64) .cse7) |c_ULTIMATE.start_main_~v~0#1| (bvmul .cse2 (_ bv2 64)))))) (or (bvsle .cse0 .cse1) (not (= (_ bv0 64) (bvadd .cse2 (bvneg (bvmul (_ bv2 64) (bvmul .cse1 .cse3))) .cse4 .cse5 .cse6))) (= (_ bv0 64) (bvadd (bvneg (bvmul (bvmul .cse3 .cse0) (_ bv2 64))) .cse2 (_ bv2 64) (bvmul |c_ULTIMATE.start_main_~y~0#1| (_ bv2 64)) .cse4 .cse5 .cse6)) (bvslt |c_ULTIMATE.start_main_~v~0#1| (_ bv0 64)) (not (bvsle |c_ULTIMATE.start_main_~x~0#1| .cse1)))))) is different from true [2023-12-25 00:46:22,856 WARN L293 SmtUtils]: Spent 8.11s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-25 00:46:48,042 WARN L293 SmtUtils]: Spent 8.11s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-25 00:47:13,439 WARN L293 SmtUtils]: Spent 8.12s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-25 00:47:17,776 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 4 not checked. [2023-12-25 00:47:17,776 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 00:47:17,776 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [281946244] [2023-12-25 00:47:17,776 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [281946244] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 00:47:17,776 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 00:47:17,777 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 23 [2023-12-25 00:47:17,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [790798837] [2023-12-25 00:47:17,777 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 00:47:17,777 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2023-12-25 00:47:17,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 00:47:17,778 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2023-12-25 00:47:17,778 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=381, Unknown=1, NotChecked=40, Total=506 [2023-12-25 00:47:17,778 INFO L87 Difference]: Start difference. First operand 58 states and 65 transitions. Second operand has 23 states, 19 states have (on average 1.736842105263158) internal successors, (33), 21 states have internal predecessors, (33), 6 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-12-25 00:47:42,638 WARN L293 SmtUtils]: Spent 10.75s on a formula simplification that was a NOOP. DAG size: 57 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-25 00:47:44,261 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.01s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 00:48:03,452 WARN L293 SmtUtils]: Spent 7.21s on a formula simplification that was a NOOP. DAG size: 38 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-25 00:48:08,150 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.04s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 00:48:12,173 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 00:48:16,175 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 00:48:24,085 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 00:48:28,129 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 00:48:38,647 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 00:48:42,114 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.88s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 00:48:43,841 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.61s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 00:48:48,482 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.36s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 00:48:54,860 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 00:48:58,894 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 00:49:12,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 00:49:12,847 INFO L93 Difference]: Finished difference Result 72 states and 81 transitions. [2023-12-25 00:49:12,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-12-25 00:49:12,848 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 19 states have (on average 1.736842105263158) internal successors, (33), 21 states have internal predecessors, (33), 6 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 24 [2023-12-25 00:49:12,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 00:49:12,848 INFO L225 Difference]: With dead ends: 72 [2023-12-25 00:49:12,848 INFO L226 Difference]: Without dead ends: 64 [2023-12-25 00:49:12,849 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 24 SyntacticMatches, 2 SemanticMatches, 31 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 176 ImplicationChecksByTransitivity, 111.7s TimeCoverageRelationStatistics Valid=188, Invalid=806, Unknown=2, NotChecked=60, Total=1056 [2023-12-25 00:49:12,849 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 27 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 252 mSolverCounterSat, 24 mSolverCounterUnsat, 8 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 58.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 328 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 252 IncrementalHoareTripleChecker+Invalid, 8 IncrementalHoareTripleChecker+Unknown, 44 IncrementalHoareTripleChecker+Unchecked, 59.7s IncrementalHoareTripleChecker+Time [2023-12-25 00:49:12,850 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 99 Invalid, 328 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 252 Invalid, 8 Unknown, 44 Unchecked, 59.7s Time] [2023-12-25 00:49:12,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2023-12-25 00:49:12,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2023-12-25 00:49:12,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 51 states have (on average 1.1568627450980393) internal successors, (59), 51 states have internal predecessors, (59), 7 states have call successors, (7), 6 states have call predecessors, (7), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-12-25 00:49:12,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 72 transitions. [2023-12-25 00:49:12,868 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 72 transitions. Word has length 24 [2023-12-25 00:49:12,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 00:49:12,868 INFO L495 AbstractCegarLoop]: Abstraction has 64 states and 72 transitions. [2023-12-25 00:49:12,869 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 19 states have (on average 1.736842105263158) internal successors, (33), 21 states have internal predecessors, (33), 6 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-12-25 00:49:12,870 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 72 transitions. [2023-12-25 00:49:12,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2023-12-25 00:49:12,870 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 00:49:12,870 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2023-12-25 00:49:12,881 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2023-12-25 00:49:13,079 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 00:49:13,079 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 00:49:13,080 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 00:49:13,080 INFO L85 PathProgramCache]: Analyzing trace with hash 506464861, now seen corresponding path program 1 times [2023-12-25 00:49:13,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 00:49:13,080 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1626395236] [2023-12-25 00:49:13,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 00:49:13,080 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 00:49:13,081 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 00:49:13,081 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 00:49:13,091 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2023-12-25 00:49:16,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 00:49:16,056 INFO L262 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 22 conjunts are in the unsatisfiable core [2023-12-25 00:49:16,058 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 00:49:25,769 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 11 proven. 15 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-12-25 00:49:25,770 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 00:51:09,206 WARN L293 SmtUtils]: Spent 8.14s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-25 00:51:27,131 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse6 ((_ sign_extend 32) |c_ULTIMATE.start_main_~Y~0#1|)) (.cse1 ((_ sign_extend 32) |c_ULTIMATE.start_main_~X~0#1|))) (let ((.cse0 (bvadd |c_ULTIMATE.start_main_~x~0#1| (_ bv1 64))) (.cse2 (bvneg .cse1)) (.cse3 (bvmul .cse6 (_ bv4 64))) (.cse4 (bvmul (_ bv2 64) (bvmul |c_ULTIMATE.start_main_~x~0#1| .cse6))) (.cse5 (bvneg (bvadd (bvmul (_ bv2 64) .cse6) |c_ULTIMATE.start_main_~v~0#1|)))) (or (bvsle .cse0 .cse1) (= (_ bv0 64) (bvadd .cse2 (bvmul |c_ULTIMATE.start_main_~y~0#1| (_ bv2 64)) .cse3 .cse4 (bvneg (bvmul (bvmul |c_ULTIMATE.start_main_~y~0#1| .cse0) (_ bv2 64))) .cse5)) (not (bvslt |c_ULTIMATE.start_main_~v~0#1| (_ bv0 64))) (not (= (bvadd .cse2 (bvneg (bvmul (bvmul |c_ULTIMATE.start_main_~y~0#1| .cse1) (_ bv2 64))) .cse3 .cse4 .cse5) (_ bv0 64))) (not (bvsle |c_ULTIMATE.start_main_~x~0#1| .cse1))))) is different from true [2023-12-25 00:51:39,452 WARN L293 SmtUtils]: Spent 8.13s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-25 00:52:06,289 WARN L293 SmtUtils]: Spent 8.14s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-25 00:52:15,715 WARN L293 SmtUtils]: Spent 5.12s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-25 00:52:32,634 WARN L293 SmtUtils]: Spent 8.13s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-25 00:52:42,180 WARN L293 SmtUtils]: Spent 5.12s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-25 00:52:59,131 WARN L293 SmtUtils]: Spent 8.13s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-25 00:53:09,062 WARN L293 SmtUtils]: Spent 5.39s on a formula simplification that was a NOOP. DAG size: 7 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-25 00:53:17,818 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse6 ((_ sign_extend 32) |c_ULTIMATE.start_main_~Y~0#1|)) (.cse1 ((_ sign_extend 32) |c_ULTIMATE.start_main_~X~0#1|))) (let ((.cse0 (bvneg .cse1)) (.cse5 (bvadd (_ bv2 64) |c_ULTIMATE.start_main_~x~0#1|)) (.cse2 (bvmul (_ bv2 64) (bvmul |c_ULTIMATE.start_main_~x~0#1| .cse6))) (.cse3 (bvneg (bvadd (bvmul (_ bv2 64) .cse6) |c_ULTIMATE.start_main_~v~0#1|))) (.cse4 (bvmul .cse6 (_ bv6 64)))) (or (not (= (_ bv0 64) (bvadd .cse0 (bvneg (bvmul (bvmul |c_ULTIMATE.start_main_~y~0#1| .cse1) (_ bv2 64))) .cse2 .cse3 .cse4))) (bvsle .cse5 .cse1) (not (bvsle (bvadd |c_ULTIMATE.start_main_~x~0#1| (_ bv1 64)) .cse1)) (= (_ bv0 64) (bvadd .cse0 (bvneg (bvmul (bvmul |c_ULTIMATE.start_main_~y~0#1| .cse5) (_ bv2 64))) (bvmul |c_ULTIMATE.start_main_~y~0#1| (_ bv2 64)) .cse2 .cse3 .cse4)) (not (bvslt |c_ULTIMATE.start_main_~v~0#1| (_ bv0 64)))))) is different from true [2023-12-25 00:53:25,953 WARN L293 SmtUtils]: Spent 8.13s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-25 00:53:39,930 WARN L293 SmtUtils]: Spent 5.40s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-25 00:53:52,928 WARN L293 SmtUtils]: Spent 8.13s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-25 00:53:57,453 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse5 ((_ sign_extend 32) |c_ULTIMATE.start_main_~Y~0#1|)) (.cse6 ((_ sign_extend 32) |c_ULTIMATE.start_main_~X~0#1|))) (let ((.cse1 (bvadd (_ bv2 64) |c_ULTIMATE.start_main_~x~0#1|)) (.cse0 (bvneg .cse6)) (.cse2 (bvneg (bvadd |c_ULTIMATE.start_main_~v~0#1| (bvmul .cse5 (_ bv4 64))))) (.cse3 (bvmul (_ bv2 64) (bvmul |c_ULTIMATE.start_main_~x~0#1| .cse5))) (.cse4 (bvmul .cse5 (_ bv6 64)))) (or (= (_ bv0 64) (bvadd .cse0 (bvneg (bvmul (bvmul |c_ULTIMATE.start_main_~y~0#1| .cse1) (_ bv2 64))) .cse2 (bvmul |c_ULTIMATE.start_main_~y~0#1| (_ bv2 64)) .cse3 .cse4)) (not (bvslt (bvadd (bvmul (_ bv2 64) .cse5) |c_ULTIMATE.start_main_~v~0#1|) (_ bv0 64))) (bvsle .cse1 .cse6) (not (= (_ bv0 64) (bvadd .cse0 .cse2 (bvneg (bvmul (bvmul |c_ULTIMATE.start_main_~y~0#1| .cse6) (_ bv2 64))) .cse3 .cse4))) (not (bvsle (bvadd |c_ULTIMATE.start_main_~x~0#1| (_ bv1 64)) .cse6)) (not (bvslt |c_ULTIMATE.start_main_~v~0#1| (_ bv0 64)))))) is different from true [2023-12-25 00:54:05,593 WARN L293 SmtUtils]: Spent 8.14s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-25 00:54:23,979 WARN L293 SmtUtils]: Spent 5.01s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-25 00:54:36,609 WARN L293 SmtUtils]: Spent 8.14s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-25 00:54:44,743 WARN L293 SmtUtils]: Spent 8.13s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-25 00:54:50,090 WARN L293 SmtUtils]: Spent 5.35s on a formula simplification that was a NOOP. DAG size: 25 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) Received shutdown request... [2023-12-25 00:55:11,892 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-12-25 00:55:11,893 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-12-25 00:55:12,353 WARN L293 SmtUtils]: Spent 8.12s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-25 00:55:12,356 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-25 00:55:12,374 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2023-12-25 00:55:12,557 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 00:55:12,557 WARN L619 AbstractCegarLoop]: Verification canceled: while NwaCegarLoop was analyzing trace of length 35 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∨-6-1 term,while PolyPacSimplificationTermWalker was simplifying 6 xjuncts wrt. a ATOM-1 context. [2023-12-25 00:55:12,561 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2023-12-25 00:55:12,562 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-25 00:55:12,564 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.12 12:55:12 BoogieIcfgContainer [2023-12-25 00:55:12,564 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-25 00:55:12,564 INFO L158 Benchmark]: Toolchain (without parser) took 889448.11ms. Allocated memory was 257.9MB in the beginning and 319.8MB in the end (delta: 61.9MB). Free memory was 203.6MB in the beginning and 104.0MB in the end (delta: 99.6MB). Peak memory consumption was 163.0MB. Max. memory is 8.0GB. [2023-12-25 00:55:12,564 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 203.4MB. Free memory is still 151.5MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-25 00:55:12,565 INFO L158 Benchmark]: CACSL2BoogieTranslator took 161.88ms. Allocated memory is still 257.9MB. Free memory was 203.6MB in the beginning and 192.0MB in the end (delta: 11.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2023-12-25 00:55:12,565 INFO L158 Benchmark]: Boogie Procedure Inliner took 34.68ms. Allocated memory is still 257.9MB. Free memory was 192.0MB in the beginning and 190.4MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-25 00:55:12,565 INFO L158 Benchmark]: Boogie Preprocessor took 45.51ms. Allocated memory is still 257.9MB. Free memory was 190.4MB in the beginning and 188.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-25 00:55:12,565 INFO L158 Benchmark]: RCFGBuilder took 582.87ms. Allocated memory is still 257.9MB. Free memory was 188.4MB in the beginning and 175.3MB in the end (delta: 13.1MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2023-12-25 00:55:12,565 INFO L158 Benchmark]: TraceAbstraction took 888617.23ms. Allocated memory was 257.9MB in the beginning and 319.8MB in the end (delta: 61.9MB). Free memory was 174.2MB in the beginning and 104.0MB in the end (delta: 70.2MB). Peak memory consumption was 133.7MB. Max. memory is 8.0GB. [2023-12-25 00:55:12,566 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11ms. Allocated memory is still 203.4MB. Free memory is still 151.5MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 161.88ms. Allocated memory is still 257.9MB. Free memory was 203.6MB in the beginning and 192.0MB in the end (delta: 11.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 34.68ms. Allocated memory is still 257.9MB. Free memory was 192.0MB in the beginning and 190.4MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 45.51ms. Allocated memory is still 257.9MB. Free memory was 190.4MB in the beginning and 188.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 582.87ms. Allocated memory is still 257.9MB. Free memory was 188.4MB in the beginning and 175.3MB in the end (delta: 13.1MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * TraceAbstraction took 888617.23ms. Allocated memory was 257.9MB in the beginning and 319.8MB in the end (delta: 61.9MB). Free memory was 174.2MB in the beginning and 104.0MB in the end (delta: 70.2MB). Peak memory consumption was 133.7MB. 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 - TimeoutResultAtElement [Line: 16]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 16). Cancelled while NwaCegarLoop was analyzing trace of length 35 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∨-6-1 term,while PolyPacSimplificationTermWalker was simplifying 6 xjuncts wrt. a ATOM-1 context. - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 17 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 888.6s, OverallIterations: 6, TraceHistogramMax: 4, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 228.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 13 mSolverCounterUnknown, 155 SdHoareTripleChecker+Valid, 111.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 152 mSDsluCounter, 401 SdHoareTripleChecker+Invalid, 109.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 44 IncrementalHoareTripleChecker+Unchecked, 354 mSDsCounter, 71 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 832 IncrementalHoareTripleChecker+Invalid, 960 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 71 mSolverCounterUnsat, 47 mSDtfsCounter, 832 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 188 GetRequests, 82 SyntacticMatches, 4 SemanticMatches, 102 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 448 ImplicationChecksByTransitivity, 245.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=64occurred in iteration=5, InterpolantAutomatonStates: 76, 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, 5 MinimizatonAttempts, 45 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 41.1s SatisfiabilityAnalysisTime, 257.9s InterpolantComputationTime, 83 NumberOfCodeBlocks, 83 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 150 ConstructedInterpolants, 0 QuantifiedInterpolants, 2340 SizeOfPredicates, 21 NumberOfNonLiveVariables, 212 ConjunctsInSsa, 67 ConjunctsInUnsatCore, 9 InterpolantComputations, 1 PerfectInterpolantSequences, 26/52 InterpolantCoveringCapability, 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 could not prove your program: Timeout Completed graceful shutdown