/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/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-co_file-91.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-23 10:20:08,559 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-23 10:20:08,609 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-23 10:20:08,612 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-23 10:20:08,612 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-23 10:20:08,625 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-23 10:20:08,626 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-23 10:20:08,627 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-23 10:20:08,628 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-23 10:20:08,630 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-23 10:20:08,631 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-23 10:20:08,631 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-23 10:20:08,632 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-23 10:20:08,633 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-23 10:20:08,633 INFO L153 SettingsManager]: * Use SBE=true [2023-12-23 10:20:08,634 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-23 10:20:08,634 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-23 10:20:08,634 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-23 10:20:08,634 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-23 10:20:08,634 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-23 10:20:08,634 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-23 10:20:08,635 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-23 10:20:08,635 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-23 10:20:08,635 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-12-23 10:20:08,635 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-12-23 10:20:08,635 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-23 10:20:08,636 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-12-23 10:20:08,636 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-23 10:20:08,636 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-23 10:20:08,636 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-23 10:20:08,637 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-23 10:20:08,637 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-23 10:20:08,637 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-23 10:20:08,637 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-23 10:20:08,637 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-23 10:20:08,637 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-23 10:20:08,637 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-23 10:20:08,638 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-23 10:20:08,638 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-12-23 10:20:08,638 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-12-23 10:20:08,638 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-23 10:20:08,638 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-23 10:20:08,638 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-23 10:20:08,638 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-23 10:20:08,639 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-23 10:20:08,639 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-12-23 10:20:08,639 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-23 10:20:08,847 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-23 10:20:08,869 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-23 10:20:08,871 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-23 10:20:08,872 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-23 10:20:08,873 INFO L274 PluginConnector]: CDTParser initialized [2023-12-23 10:20:08,874 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-co_file-91.i [2023-12-23 10:20:09,905 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-23 10:20:10,098 INFO L384 CDTParser]: Found 1 translation units. [2023-12-23 10:20:10,098 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-co_file-91.i [2023-12-23 10:20:10,106 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/801240ca6/a70fbc24b874448baf15f5fc8fa3edc1/FLAG3718f854d [2023-12-23 10:20:10,117 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/801240ca6/a70fbc24b874448baf15f5fc8fa3edc1 [2023-12-23 10:20:10,119 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-23 10:20:10,121 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-23 10:20:10,122 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-23 10:20:10,122 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-23 10:20:10,131 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-23 10:20:10,132 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.12 10:20:10" (1/1) ... [2023-12-23 10:20:10,133 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7cb6d66d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 10:20:10, skipping insertion in model container [2023-12-23 10:20:10,133 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.12 10:20:10" (1/1) ... [2023-12-23 10:20:10,170 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-23 10:20:10,272 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-co_file-91.i[919,932] [2023-12-23 10:20:10,337 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-23 10:20:10,350 INFO L202 MainTranslator]: Completed pre-run [2023-12-23 10:20:10,359 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-co_file-91.i[919,932] [2023-12-23 10:20:10,384 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-23 10:20:10,398 INFO L206 MainTranslator]: Completed translation [2023-12-23 10:20:10,399 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 10:20:10 WrapperNode [2023-12-23 10:20:10,399 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-23 10:20:10,400 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-23 10:20:10,400 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-23 10:20:10,401 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-23 10:20:10,406 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 10:20:10" (1/1) ... [2023-12-23 10:20:10,417 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 10:20:10" (1/1) ... [2023-12-23 10:20:10,449 INFO L138 Inliner]: procedures = 27, calls = 54, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 245 [2023-12-23 10:20:10,450 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-23 10:20:10,450 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-23 10:20:10,450 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-23 10:20:10,450 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-23 10:20:10,459 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 10:20:10" (1/1) ... [2023-12-23 10:20:10,459 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 10:20:10" (1/1) ... [2023-12-23 10:20:10,463 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 10:20:10" (1/1) ... [2023-12-23 10:20:10,475 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-23 10:20:10,477 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 10:20:10" (1/1) ... [2023-12-23 10:20:10,478 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 10:20:10" (1/1) ... [2023-12-23 10:20:10,488 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 10:20:10" (1/1) ... [2023-12-23 10:20:10,495 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 10:20:10" (1/1) ... [2023-12-23 10:20:10,497 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 10:20:10" (1/1) ... [2023-12-23 10:20:10,499 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 10:20:10" (1/1) ... [2023-12-23 10:20:10,503 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-23 10:20:10,503 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-23 10:20:10,504 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-23 10:20:10,504 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-23 10:20:10,504 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 10:20:10" (1/1) ... [2023-12-23 10:20:10,523 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-23 10:20:10,534 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-23 10:20:10,555 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-23 10:20:10,577 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-23 10:20:10,583 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-23 10:20:10,583 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-12-23 10:20:10,583 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-12-23 10:20:10,585 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-12-23 10:20:10,585 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-23 10:20:10,585 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-23 10:20:10,653 INFO L241 CfgBuilder]: Building ICFG [2023-12-23 10:20:10,655 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-23 10:20:19,537 INFO L282 CfgBuilder]: Performing block encoding [2023-12-23 10:20:19,598 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-23 10:20:19,598 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-23 10:20:19,599 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.12 10:20:19 BoogieIcfgContainer [2023-12-23 10:20:19,599 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-23 10:20:19,600 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-23 10:20:19,600 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-23 10:20:19,603 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-23 10:20:19,603 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.12 10:20:10" (1/3) ... [2023-12-23 10:20:19,603 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75d060de and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.12 10:20:19, skipping insertion in model container [2023-12-23 10:20:19,603 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 10:20:10" (2/3) ... [2023-12-23 10:20:19,604 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75d060de and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.12 10:20:19, skipping insertion in model container [2023-12-23 10:20:19,604 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.12 10:20:19" (3/3) ... [2023-12-23 10:20:19,605 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pe-co_file-91.i [2023-12-23 10:20:19,621 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-23 10:20:19,621 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-23 10:20:19,666 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-23 10:20:19,671 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;@59a3b75b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-23 10:20:19,671 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-23 10:20:19,681 INFO L276 IsEmpty]: Start isEmpty. Operand has 103 states, 59 states have (on average 1.3898305084745763) internal successors, (82), 60 states have internal predecessors, (82), 41 states have call successors, (41), 1 states have call predecessors, (41), 1 states have return successors, (41), 41 states have call predecessors, (41), 41 states have call successors, (41) [2023-12-23 10:20:19,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 255 [2023-12-23 10:20:19,696 INFO L187 NwaCegarLoop]: Found error trace [2023-12-23 10:20:19,696 INFO L195 NwaCegarLoop]: trace histogram [41, 41, 41, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-23 10:20:19,697 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-23 10:20:19,700 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-23 10:20:19,701 INFO L85 PathProgramCache]: Analyzing trace with hash -235603460, now seen corresponding path program 1 times [2023-12-23 10:20:19,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-23 10:20:19,711 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [4682846] [2023-12-23 10:20:19,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-23 10:20:19,712 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-23 10:20:19,712 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-23 10:20:19,718 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-23 10:20:19,719 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-23 10:20:20,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-23 10:20:20,351 INFO L262 TraceCheckSpWp]: Trace formula consists of 412 conjuncts, 1 conjunts are in the unsatisfiable core [2023-12-23 10:20:20,367 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-23 10:20:20,414 INFO L134 CoverageAnalysis]: Checked inductivity of 3280 backedges. 780 proven. 0 refuted. 0 times theorem prover too weak. 2500 trivial. 0 not checked. [2023-12-23 10:20:20,414 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-23 10:20:20,415 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-23 10:20:20,415 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [4682846] [2023-12-23 10:20:20,416 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [4682846] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-23 10:20:20,416 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-23 10:20:20,416 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-23 10:20:20,417 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1272815925] [2023-12-23 10:20:20,418 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-23 10:20:20,425 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-23 10:20:20,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-23 10:20:20,451 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-23 10:20:20,452 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-23 10:20:20,454 INFO L87 Difference]: Start difference. First operand has 103 states, 59 states have (on average 1.3898305084745763) internal successors, (82), 60 states have internal predecessors, (82), 41 states have call successors, (41), 1 states have call predecessors, (41), 1 states have return successors, (41), 41 states have call predecessors, (41), 41 states have call successors, (41) Second operand has 2 states, 2 states have (on average 28.0) internal successors, (56), 2 states have internal predecessors, (56), 2 states have call successors, (41), 2 states have call predecessors, (41), 2 states have return successors, (41), 2 states have call predecessors, (41), 2 states have call successors, (41) [2023-12-23 10:20:20,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-23 10:20:20,776 INFO L93 Difference]: Finished difference Result 203 states and 367 transitions. [2023-12-23 10:20:20,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-23 10:20:20,790 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 28.0) internal successors, (56), 2 states have internal predecessors, (56), 2 states have call successors, (41), 2 states have call predecessors, (41), 2 states have return successors, (41), 2 states have call predecessors, (41), 2 states have call successors, (41) Word has length 254 [2023-12-23 10:20:20,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-23 10:20:20,796 INFO L225 Difference]: With dead ends: 203 [2023-12-23 10:20:20,796 INFO L226 Difference]: Without dead ends: 101 [2023-12-23 10:20:20,799 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 253 GetRequests, 253 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-23 10:20:20,802 INFO L413 NwaCegarLoop]: 154 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 154 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-23 10:20:20,802 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 154 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-23 10:20:20,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2023-12-23 10:20:20,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2023-12-23 10:20:20,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 58 states have (on average 1.293103448275862) internal successors, (75), 58 states have internal predecessors, (75), 41 states have call successors, (41), 1 states have call predecessors, (41), 1 states have return successors, (41), 41 states have call predecessors, (41), 41 states have call successors, (41) [2023-12-23 10:20:20,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 157 transitions. [2023-12-23 10:20:20,852 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 157 transitions. Word has length 254 [2023-12-23 10:20:20,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-23 10:20:20,853 INFO L495 AbstractCegarLoop]: Abstraction has 101 states and 157 transitions. [2023-12-23 10:20:20,853 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 28.0) internal successors, (56), 2 states have internal predecessors, (56), 2 states have call successors, (41), 2 states have call predecessors, (41), 2 states have return successors, (41), 2 states have call predecessors, (41), 2 states have call successors, (41) [2023-12-23 10:20:20,853 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 157 transitions. [2023-12-23 10:20:20,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2023-12-23 10:20:20,859 INFO L187 NwaCegarLoop]: Found error trace [2023-12-23 10:20:20,860 INFO L195 NwaCegarLoop]: trace histogram [41, 41, 41, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-23 10:20:20,878 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 (2)] Forceful destruction successful, exit code 0 [2023-12-23 10:20:21,060 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-23 10:20:21,061 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-23 10:20:21,061 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-23 10:20:21,062 INFO L85 PathProgramCache]: Analyzing trace with hash 108006528, now seen corresponding path program 1 times [2023-12-23 10:20:21,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-23 10:20:21,063 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [154580047] [2023-12-23 10:20:21,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-23 10:20:21,063 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-23 10:20:21,063 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-23 10:20:21,064 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-23 10:20:21,067 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-23 10:20:21,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-23 10:20:21,694 INFO L262 TraceCheckSpWp]: Trace formula consists of 414 conjuncts, 5 conjunts are in the unsatisfiable core [2023-12-23 10:20:21,700 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-23 10:20:22,840 INFO L134 CoverageAnalysis]: Checked inductivity of 3280 backedges. 1674 proven. 63 refuted. 0 times theorem prover too weak. 1543 trivial. 0 not checked. [2023-12-23 10:20:22,840 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-23 10:20:23,519 INFO L134 CoverageAnalysis]: Checked inductivity of 3280 backedges. 57 proven. 63 refuted. 0 times theorem prover too weak. 3160 trivial. 0 not checked. [2023-12-23 10:20:23,520 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-23 10:20:23,520 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [154580047] [2023-12-23 10:20:23,520 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [154580047] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-23 10:20:23,520 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-23 10:20:23,520 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2023-12-23 10:20:23,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1210285615] [2023-12-23 10:20:23,521 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-23 10:20:23,522 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-23 10:20:23,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-23 10:20:23,523 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-23 10:20:23,523 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2023-12-23 10:20:23,523 INFO L87 Difference]: Start difference. First operand 101 states and 157 transitions. Second operand has 8 states, 8 states have (on average 7.75) internal successors, (62), 8 states have internal predecessors, (62), 2 states have call successors, (62), 2 states have call predecessors, (62), 4 states have return successors, (63), 2 states have call predecessors, (63), 2 states have call successors, (63) [2023-12-23 10:20:26,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-23 10:20:26,484 INFO L93 Difference]: Finished difference Result 293 states and 447 transitions. [2023-12-23 10:20:26,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-12-23 10:20:26,485 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.75) internal successors, (62), 8 states have internal predecessors, (62), 2 states have call successors, (62), 2 states have call predecessors, (62), 4 states have return successors, (63), 2 states have call predecessors, (63), 2 states have call successors, (63) Word has length 255 [2023-12-23 10:20:26,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-23 10:20:26,488 INFO L225 Difference]: With dead ends: 293 [2023-12-23 10:20:26,488 INFO L226 Difference]: Without dead ends: 193 [2023-12-23 10:20:26,489 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 520 GetRequests, 502 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=112, Invalid=230, Unknown=0, NotChecked=0, Total=342 [2023-12-23 10:20:26,490 INFO L413 NwaCegarLoop]: 181 mSDtfsCounter, 240 mSDsluCounter, 266 mSDsCounter, 0 mSdLazyCounter, 479 mSolverCounterSat, 166 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 260 SdHoareTripleChecker+Valid, 447 SdHoareTripleChecker+Invalid, 645 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 166 IncrementalHoareTripleChecker+Valid, 479 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2023-12-23 10:20:26,491 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [260 Valid, 447 Invalid, 645 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [166 Valid, 479 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2023-12-23 10:20:26,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2023-12-23 10:20:26,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 104. [2023-12-23 10:20:26,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 60 states have (on average 1.2166666666666666) internal successors, (73), 60 states have internal predecessors, (73), 41 states have call successors, (41), 2 states have call predecessors, (41), 2 states have return successors, (41), 41 states have call predecessors, (41), 41 states have call successors, (41) [2023-12-23 10:20:26,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 155 transitions. [2023-12-23 10:20:26,510 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 155 transitions. Word has length 255 [2023-12-23 10:20:26,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-23 10:20:26,511 INFO L495 AbstractCegarLoop]: Abstraction has 104 states and 155 transitions. [2023-12-23 10:20:26,511 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.75) internal successors, (62), 8 states have internal predecessors, (62), 2 states have call successors, (62), 2 states have call predecessors, (62), 4 states have return successors, (63), 2 states have call predecessors, (63), 2 states have call successors, (63) [2023-12-23 10:20:26,511 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 155 transitions. [2023-12-23 10:20:26,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 257 [2023-12-23 10:20:26,514 INFO L187 NwaCegarLoop]: Found error trace [2023-12-23 10:20:26,514 INFO L195 NwaCegarLoop]: trace histogram [41, 41, 41, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-23 10:20:26,530 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-23 10:20:26,727 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-23 10:20:26,728 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-23 10:20:26,728 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-23 10:20:26,729 INFO L85 PathProgramCache]: Analyzing trace with hash 1684964288, now seen corresponding path program 1 times [2023-12-23 10:20:26,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-23 10:20:26,729 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1276107119] [2023-12-23 10:20:26,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-23 10:20:26,730 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-23 10:20:26,730 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-23 10:20:26,731 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-23 10:20:26,739 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-23 10:20:27,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-23 10:20:27,258 INFO L262 TraceCheckSpWp]: Trace formula consists of 414 conjuncts, 7 conjunts are in the unsatisfiable core [2023-12-23 10:20:27,285 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-23 10:20:29,136 INFO L134 CoverageAnalysis]: Checked inductivity of 3280 backedges. 1754 proven. 99 refuted. 0 times theorem prover too weak. 1427 trivial. 0 not checked. [2023-12-23 10:20:29,136 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-23 10:20:30,309 INFO L134 CoverageAnalysis]: Checked inductivity of 3280 backedges. 135 proven. 102 refuted. 0 times theorem prover too weak. 3043 trivial. 0 not checked. [2023-12-23 10:20:30,309 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-23 10:20:30,310 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1276107119] [2023-12-23 10:20:30,310 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1276107119] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-23 10:20:30,310 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-23 10:20:30,310 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 12 [2023-12-23 10:20:30,310 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [366249568] [2023-12-23 10:20:30,310 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-23 10:20:30,311 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-12-23 10:20:30,311 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-23 10:20:30,312 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-12-23 10:20:30,312 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2023-12-23 10:20:30,312 INFO L87 Difference]: Start difference. First operand 104 states and 155 transitions. Second operand has 12 states, 12 states have (on average 6.0) internal successors, (72), 12 states have internal predecessors, (72), 3 states have call successors, (59), 3 states have call predecessors, (59), 7 states have return successors, (60), 3 states have call predecessors, (60), 3 states have call successors, (60) [2023-12-23 10:20:32,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-23 10:20:32,947 INFO L93 Difference]: Finished difference Result 267 states and 390 transitions. [2023-12-23 10:20:32,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-12-23 10:20:32,947 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 6.0) internal successors, (72), 12 states have internal predecessors, (72), 3 states have call successors, (59), 3 states have call predecessors, (59), 7 states have return successors, (60), 3 states have call predecessors, (60), 3 states have call successors, (60) Word has length 256 [2023-12-23 10:20:32,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-23 10:20:32,950 INFO L225 Difference]: With dead ends: 267 [2023-12-23 10:20:32,950 INFO L226 Difference]: Without dead ends: 164 [2023-12-23 10:20:32,951 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 517 GetRequests, 499 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=126, Invalid=216, Unknown=0, NotChecked=0, Total=342 [2023-12-23 10:20:32,952 INFO L413 NwaCegarLoop]: 146 mSDtfsCounter, 145 mSDsluCounter, 233 mSDsCounter, 0 mSdLazyCounter, 570 mSolverCounterSat, 87 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 190 SdHoareTripleChecker+Valid, 379 SdHoareTripleChecker+Invalid, 657 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 87 IncrementalHoareTripleChecker+Valid, 570 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2023-12-23 10:20:32,957 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [190 Valid, 379 Invalid, 657 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [87 Valid, 570 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2023-12-23 10:20:32,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2023-12-23 10:20:32,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 150. [2023-12-23 10:20:32,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 81 states have (on average 1.1481481481481481) internal successors, (93), 82 states have internal predecessors, (93), 63 states have call successors, (63), 5 states have call predecessors, (63), 5 states have return successors, (63), 62 states have call predecessors, (63), 63 states have call successors, (63) [2023-12-23 10:20:32,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 219 transitions. [2023-12-23 10:20:32,973 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 219 transitions. Word has length 256 [2023-12-23 10:20:32,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-23 10:20:32,974 INFO L495 AbstractCegarLoop]: Abstraction has 150 states and 219 transitions. [2023-12-23 10:20:32,974 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.0) internal successors, (72), 12 states have internal predecessors, (72), 3 states have call successors, (59), 3 states have call predecessors, (59), 7 states have return successors, (60), 3 states have call predecessors, (60), 3 states have call successors, (60) [2023-12-23 10:20:32,974 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 219 transitions. [2023-12-23 10:20:32,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 257 [2023-12-23 10:20:32,976 INFO L187 NwaCegarLoop]: Found error trace [2023-12-23 10:20:32,976 INFO L195 NwaCegarLoop]: trace histogram [41, 41, 41, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-23 10:20:32,990 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-23 10:20:33,193 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-23 10:20:33,193 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-23 10:20:33,194 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-23 10:20:33,194 INFO L85 PathProgramCache]: Analyzing trace with hash 983899710, now seen corresponding path program 1 times [2023-12-23 10:20:33,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-23 10:20:33,194 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1718429293] [2023-12-23 10:20:33,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-23 10:20:33,195 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-23 10:20:33,195 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-23 10:20:33,196 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-23 10:20:33,197 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-23 10:20:33,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-23 10:20:33,681 INFO L262 TraceCheckSpWp]: Trace formula consists of 416 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-23 10:20:33,685 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-23 10:20:34,305 INFO L134 CoverageAnalysis]: Checked inductivity of 3280 backedges. 1374 proven. 33 refuted. 0 times theorem prover too weak. 1873 trivial. 0 not checked. [2023-12-23 10:20:34,306 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-23 10:20:34,839 INFO L134 CoverageAnalysis]: Checked inductivity of 3280 backedges. 87 proven. 33 refuted. 0 times theorem prover too weak. 3160 trivial. 0 not checked. [2023-12-23 10:20:34,840 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-23 10:20:34,840 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1718429293] [2023-12-23 10:20:34,840 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1718429293] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-23 10:20:34,840 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-23 10:20:34,840 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2023-12-23 10:20:34,840 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1726233882] [2023-12-23 10:20:34,840 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-23 10:20:34,841 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-23 10:20:34,841 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-23 10:20:34,842 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-23 10:20:34,842 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-12-23 10:20:34,842 INFO L87 Difference]: Start difference. First operand 150 states and 219 transitions. Second operand has 7 states, 7 states have (on average 9.0) internal successors, (63), 7 states have internal predecessors, (63), 2 states have call successors, (52), 2 states have call predecessors, (52), 4 states have return successors, (53), 2 states have call predecessors, (53), 2 states have call successors, (53) [2023-12-23 10:20:36,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-23 10:20:36,116 INFO L93 Difference]: Finished difference Result 275 states and 391 transitions. [2023-12-23 10:20:36,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-23 10:20:36,128 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.0) internal successors, (63), 7 states have internal predecessors, (63), 2 states have call successors, (52), 2 states have call predecessors, (52), 4 states have return successors, (53), 2 states have call predecessors, (53), 2 states have call successors, (53) Word has length 256 [2023-12-23 10:20:36,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-23 10:20:36,130 INFO L225 Difference]: With dead ends: 275 [2023-12-23 10:20:36,130 INFO L226 Difference]: Without dead ends: 164 [2023-12-23 10:20:36,131 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 514 GetRequests, 504 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2023-12-23 10:20:36,132 INFO L413 NwaCegarLoop]: 104 mSDtfsCounter, 72 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 222 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 227 SdHoareTripleChecker+Invalid, 232 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 222 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2023-12-23 10:20:36,133 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 227 Invalid, 232 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 222 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2023-12-23 10:20:36,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2023-12-23 10:20:36,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 154. [2023-12-23 10:20:36,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 84 states have (on average 1.130952380952381) internal successors, (95), 85 states have internal predecessors, (95), 63 states have call successors, (63), 6 states have call predecessors, (63), 6 states have return successors, (63), 62 states have call predecessors, (63), 63 states have call successors, (63) [2023-12-23 10:20:36,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 221 transitions. [2023-12-23 10:20:36,159 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 221 transitions. Word has length 256 [2023-12-23 10:20:36,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-23 10:20:36,161 INFO L495 AbstractCegarLoop]: Abstraction has 154 states and 221 transitions. [2023-12-23 10:20:36,161 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.0) internal successors, (63), 7 states have internal predecessors, (63), 2 states have call successors, (52), 2 states have call predecessors, (52), 4 states have return successors, (53), 2 states have call predecessors, (53), 2 states have call successors, (53) [2023-12-23 10:20:36,161 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 221 transitions. [2023-12-23 10:20:36,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 257 [2023-12-23 10:20:36,163 INFO L187 NwaCegarLoop]: Found error trace [2023-12-23 10:20:36,163 INFO L195 NwaCegarLoop]: trace histogram [41, 41, 41, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-23 10:20:36,189 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 (5)] Forceful destruction successful, exit code 0 [2023-12-23 10:20:36,363 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-23 10:20:36,364 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-23 10:20:36,365 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-23 10:20:36,365 INFO L85 PathProgramCache]: Analyzing trace with hash 174553084, now seen corresponding path program 1 times [2023-12-23 10:20:36,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-23 10:20:36,365 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1494038115] [2023-12-23 10:20:36,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-23 10:20:36,366 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-23 10:20:36,366 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-23 10:20:36,368 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-23 10:20:36,371 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-23 10:20:36,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-23 10:20:36,904 INFO L262 TraceCheckSpWp]: Trace formula consists of 415 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-23 10:20:36,907 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-23 10:20:45,978 WARN L293 SmtUtils]: Spent 7.41s on a formula simplification that was a NOOP. DAG size: 11 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-23 10:20:54,123 WARN L293 SmtUtils]: Spent 8.13s on a formula simplification that was a NOOP. DAG size: 10 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-23 10:20:58,271 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (fp.lt c_~var_1_17~0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32))))) (or (and (not .cse0) (exists ((~var_1_51~0 (_ FloatingPoint 11 53)) (~var_1_53~0 (_ FloatingPoint 11 53)) (~var_1_54~0 (_ FloatingPoint 11 53))) (fp.geq (fp.sub roundNearestTiesToEven ~var_1_53~0 ~var_1_54~0) (fp.mul roundNearestTiesToEven (fp.neg ~var_1_51~0) ((_ to_fp 11 53) roundNearestTiesToEven c_~var_1_17~0))))) (and (exists ((~var_1_51~0 (_ FloatingPoint 11 53)) (~var_1_53~0 (_ FloatingPoint 11 53)) (~var_1_54~0 (_ FloatingPoint 11 53))) (fp.geq (fp.sub roundNearestTiesToEven ~var_1_53~0 ~var_1_54~0) (fp.mul roundNearestTiesToEven (fp.neg ~var_1_51~0) ((_ to_fp 11 53) roundNearestTiesToEven (fp.neg c_~var_1_17~0))))) .cse0))) is different from false [2023-12-23 10:21:08,327 WARN L293 SmtUtils]: Spent 8.13s on a formula simplification that was a NOOP. DAG size: 11 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-23 10:21:16,488 WARN L293 SmtUtils]: Spent 8.14s on a formula simplification that was a NOOP. DAG size: 10 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-23 10:21:16,888 INFO L134 CoverageAnalysis]: Checked inductivity of 3280 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3280 trivial. 0 not checked. [2023-12-23 10:21:16,888 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-23 10:21:16,888 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-23 10:21:16,889 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1494038115] [2023-12-23 10:21:16,889 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1494038115] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-23 10:21:16,889 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-23 10:21:16,889 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-23 10:21:16,889 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2085154715] [2023-12-23 10:21:16,889 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-23 10:21:16,889 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-23 10:21:16,889 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-23 10:21:16,890 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-23 10:21:16,890 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=4, Unknown=1, NotChecked=2, Total=12 [2023-12-23 10:21:16,890 INFO L87 Difference]: Start difference. First operand 154 states and 221 transitions. Second operand has 4 states, 4 states have (on average 13.5) internal successors, (54), 3 states have internal predecessors, (54), 1 states have call successors, (41), 1 states have call predecessors, (41), 1 states have return successors, (41), 1 states have call predecessors, (41), 1 states have call successors, (41) [2023-12-23 10:21:21,452 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.18s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-23 10:21:25,661 WARN L854 $PredicateComparison]: unable to prove that (and (let ((.cse0 (fp.lt c_~var_1_17~0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32))))) (or (and (not .cse0) (exists ((~var_1_51~0 (_ FloatingPoint 11 53)) (~var_1_53~0 (_ FloatingPoint 11 53)) (~var_1_54~0 (_ FloatingPoint 11 53))) (fp.geq (fp.sub roundNearestTiesToEven ~var_1_53~0 ~var_1_54~0) (fp.mul roundNearestTiesToEven (fp.neg ~var_1_51~0) ((_ to_fp 11 53) roundNearestTiesToEven c_~var_1_17~0))))) (and (exists ((~var_1_51~0 (_ FloatingPoint 11 53)) (~var_1_53~0 (_ FloatingPoint 11 53)) (~var_1_54~0 (_ FloatingPoint 11 53))) (fp.geq (fp.sub roundNearestTiesToEven ~var_1_53~0 ~var_1_54~0) (fp.mul roundNearestTiesToEven (fp.neg ~var_1_51~0) ((_ to_fp 11 53) roundNearestTiesToEven (fp.neg c_~var_1_17~0))))) .cse0))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from false [2023-12-23 10:21:29,848 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.17s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-23 10:21:34,778 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.18s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-23 10:21:38,022 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.24s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-23 10:21:38,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-23 10:21:38,023 INFO L93 Difference]: Finished difference Result 386 states and 546 transitions. [2023-12-23 10:21:38,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-23 10:21:38,106 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 3 states have internal predecessors, (54), 1 states have call successors, (41), 1 states have call predecessors, (41), 1 states have return successors, (41), 1 states have call predecessors, (41), 1 states have call successors, (41) Word has length 256 [2023-12-23 10:21:38,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-23 10:21:38,109 INFO L225 Difference]: With dead ends: 386 [2023-12-23 10:21:38,109 INFO L226 Difference]: Without dead ends: 271 [2023-12-23 10:21:38,109 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 256 GetRequests, 253 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.3s TimeCoverageRelationStatistics Valid=7, Invalid=5, Unknown=2, NotChecked=6, Total=20 [2023-12-23 10:21:38,110 INFO L413 NwaCegarLoop]: 140 mSDtfsCounter, 20 mSDsluCounter, 275 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 0 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 16.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 415 SdHoareTripleChecker+Invalid, 128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 96 IncrementalHoareTripleChecker+Unchecked, 16.9s IncrementalHoareTripleChecker+Time [2023-12-23 10:21:38,110 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 415 Invalid, 128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 29 Invalid, 3 Unknown, 96 Unchecked, 16.9s Time] [2023-12-23 10:21:38,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2023-12-23 10:21:38,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 269. [2023-12-23 10:21:38,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 269 states, 153 states have (on average 1.1437908496732025) internal successors, (175), 154 states have internal predecessors, (175), 104 states have call successors, (104), 11 states have call predecessors, (104), 11 states have return successors, (104), 103 states have call predecessors, (104), 104 states have call successors, (104) [2023-12-23 10:21:38,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 383 transitions. [2023-12-23 10:21:38,137 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 383 transitions. Word has length 256 [2023-12-23 10:21:38,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-23 10:21:38,138 INFO L495 AbstractCegarLoop]: Abstraction has 269 states and 383 transitions. [2023-12-23 10:21:38,138 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 3 states have internal predecessors, (54), 1 states have call successors, (41), 1 states have call predecessors, (41), 1 states have return successors, (41), 1 states have call predecessors, (41), 1 states have call successors, (41) [2023-12-23 10:21:38,138 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 383 transitions. [2023-12-23 10:21:38,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 257 [2023-12-23 10:21:38,139 INFO L187 NwaCegarLoop]: Found error trace [2023-12-23 10:21:38,139 INFO L195 NwaCegarLoop]: trace histogram [41, 41, 41, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-23 10:21:38,154 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-23 10:21:38,344 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-23 10:21:38,345 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-23 10:21:38,346 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-23 10:21:38,346 INFO L85 PathProgramCache]: Analyzing trace with hash 174493502, now seen corresponding path program 1 times [2023-12-23 10:21:38,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-23 10:21:38,347 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [539413247] [2023-12-23 10:21:38,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-23 10:21:38,349 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-23 10:21:38,349 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-23 10:21:38,350 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-23 10:21:38,352 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-23 10:21:38,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-23 10:21:38,889 INFO L262 TraceCheckSpWp]: Trace formula consists of 416 conjuncts, 20 conjunts are in the unsatisfiable core [2023-12-23 10:21:38,894 INFO L285 TraceCheckSpWp]: Computing forward predicates... Received shutdown request... [2023-12-23 10:34:11,140 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-23 10:34:11,142 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-23 10:34:12,168 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-23 10:34:12,312 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 [2023-12-23 10:34:13,400 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-23 10:34:13,401 WARN L619 AbstractCegarLoop]: Verification canceled: while NwaCegarLoop was analyzing trace of length 257 with TraceHistMax 41,while TraceCheckSpWp was constructing forward predicates,while PolyPacSimplificationTermWalker was simplifying a ∧-16-2-2-2-2-2-2-2-3-2-2-2-3-2-2-2-2-2-2-2-2-2-3-2-2-2-3-2-3-2-3-2-3-2-3-2-3-2-3-2-3-2-3-2-3-2-3-2-3-2-3-2-3-2-3-2-3-2-3-2-3-2-3-2-3-2-3-2-3-2-3-2-3-2-3-2-3-2-3-2-3-2-3-2-3-2-3-2-3-2-3-2-3-2-3-2-3-2-3-2-3-2-3-2-3-2-3-2-3-2-3-2-3-2-2-2-2-2-2-2-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∧-73-3-2-3-2-3-2-3-2-3-2-3-2-3-2-3-2-3-2-3-2-3-2-3-2-3-2-3-2-3-2-3-2-3-2-3-2-3-2-3-2-3-2-3-2-3-2-3-2-3-2-3-2-3-2-3-2-3-2-3-2-3-2-3-2-3-2-3-2-3-2-3-2-3-2-3-2-3-2-3-2-3-2-3-2-3-2-3-2-3-2-3-2-3-2-3-2-3-2-3-2-3-2-3-2-3-2-3-2-3-2-3-2-2-2-2-2-2-2-2-1 context. [2023-12-23 10:34:13,407 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2023-12-23 10:34:13,409 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-23 10:34:13,412 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.12 10:34:13 BoogieIcfgContainer [2023-12-23 10:34:13,414 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-23 10:34:13,415 INFO L158 Benchmark]: Toolchain (without parser) took 843293.34ms. Allocated memory was 266.3MB in the beginning and 8.0GB in the end (delta: 7.7GB). Free memory was 212.0MB in the beginning and 4.4GB in the end (delta: -4.2GB). Peak memory consumption was 7.6GB. Max. memory is 8.0GB. [2023-12-23 10:34:13,416 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 213.9MB. Free memory was 163.0MB in the beginning and 162.8MB in the end (delta: 184.7kB). There was no memory consumed. Max. memory is 8.0GB. [2023-12-23 10:34:13,416 INFO L158 Benchmark]: CACSL2BoogieTranslator took 277.09ms. Allocated memory is still 266.3MB. Free memory was 212.0MB in the beginning and 194.8MB in the end (delta: 17.2MB). Peak memory consumption was 17.8MB. Max. memory is 8.0GB. [2023-12-23 10:34:13,416 INFO L158 Benchmark]: Boogie Procedure Inliner took 49.69ms. Allocated memory is still 266.3MB. Free memory was 194.8MB in the beginning and 191.9MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-23 10:34:13,416 INFO L158 Benchmark]: Boogie Preprocessor took 52.72ms. Allocated memory is still 266.3MB. Free memory was 191.9MB in the beginning and 187.8MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2023-12-23 10:34:13,416 INFO L158 Benchmark]: RCFGBuilder took 9095.47ms. Allocated memory is still 266.3MB. Free memory was 187.8MB in the beginning and 204.7MB in the end (delta: -17.0MB). Peak memory consumption was 13.4MB. Max. memory is 8.0GB. [2023-12-23 10:34:13,418 INFO L158 Benchmark]: TraceAbstraction took 833813.61ms. Allocated memory was 266.3MB in the beginning and 8.0GB in the end (delta: 7.7GB). Free memory was 203.7MB in the beginning and 4.4GB in the end (delta: -4.2GB). Peak memory consumption was 7.6GB. Max. memory is 8.0GB. [2023-12-23 10:34:13,420 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.19ms. Allocated memory is still 213.9MB. Free memory was 163.0MB in the beginning and 162.8MB in the end (delta: 184.7kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 277.09ms. Allocated memory is still 266.3MB. Free memory was 212.0MB in the beginning and 194.8MB in the end (delta: 17.2MB). Peak memory consumption was 17.8MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 49.69ms. Allocated memory is still 266.3MB. Free memory was 194.8MB in the beginning and 191.9MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 52.72ms. Allocated memory is still 266.3MB. Free memory was 191.9MB in the beginning and 187.8MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * RCFGBuilder took 9095.47ms. Allocated memory is still 266.3MB. Free memory was 187.8MB in the beginning and 204.7MB in the end (delta: -17.0MB). Peak memory consumption was 13.4MB. Max. memory is 8.0GB. * TraceAbstraction took 833813.61ms. Allocated memory was 266.3MB in the beginning and 8.0GB in the end (delta: 7.7GB). Free memory was 203.7MB in the beginning and 4.4GB in the end (delta: -4.2GB). Peak memory consumption was 7.6GB. 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: 19]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 19). Cancelled while NwaCegarLoop was analyzing trace of length 257 with TraceHistMax 41,while TraceCheckSpWp was constructing forward predicates,while PolyPacSimplificationTermWalker was simplifying a ∧-16-2-2-2-2-2-2-2-3-2-2-2-3-2-2-2-2-2-2-2-2-2-3-2-2-2-3-2-3-2-3-2-3-2-3-2-3-2-3-2-3-2-3-2-3-2-3-2-3-2-3-2-3-2-3-2-3-2-3-2-3-2-3-2-3-2-3-2-3-2-3-2-3-2-3-2-3-2-3-2-3-2-3-2-3-2-3-2-3-2-3-2-3-2-3-2-3-2-3-2-3-2-3-2-3-2-3-2-3-2-3-2-3-2-2-2-2-2-2-2-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∧-73-3-2-3-2-3-2-3-2-3-2-3-2-3-2-3-2-3-2-3-2-3-2-3-2-3-2-3-2-3-2-3-2-3-2-3-2-3-2-3-2-3-2-3-2-3-2-3-2-3-2-3-2-3-2-3-2-3-2-3-2-3-2-3-2-3-2-3-2-3-2-3-2-3-2-3-2-3-2-3-2-3-2-3-2-3-2-3-2-3-2-3-2-3-2-3-2-3-2-3-2-3-2-3-2-3-2-3-2-3-2-3-2-2-2-2-2-2-2-2-1 context. - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 103 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 833.8s, OverallIterations: 6, TraceHistogramMax: 41, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 28.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 3 mSolverCounterUnknown, 570 SdHoareTripleChecker+Valid, 23.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 477 mSDsluCounter, 1622 SdHoareTripleChecker+Invalid, 22.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 96 IncrementalHoareTripleChecker+Unchecked, 897 mSDsCounter, 263 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1303 IncrementalHoareTripleChecker+Invalid, 1665 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 263 mSolverCounterUnsat, 725 mSDtfsCounter, 1303 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2060 GetRequests, 2011 SyntacticMatches, 3 SemanticMatches, 46 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 108 ImplicationChecksByTransitivity, 11.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=269occurred in iteration=5, InterpolantAutomatonStates: 48, 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, 115 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 2.3s SatisfiabilityAnalysisTime, 46.2s InterpolantComputationTime, 1277 NumberOfCodeBlocks, 1277 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 2036 ConstructedInterpolants, 2 QuantifiedInterpolants, 4873 SizeOfPredicates, 15 NumberOfNonLiveVariables, 2071 ConjunctsInSsa, 20 ConjunctsInUnsatCore, 8 InterpolantComputations, 2 PerfectInterpolantSequences, 25847/26240 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