/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_Default.epf --cacsl2boogietranslator.use.bitabs.translation false -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/hardness-nfm22/hardness_codestructure_steplocals_file-68.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-16 02:41:11,222 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-16 02:41:11,292 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2023-12-16 02:41:11,294 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-16 02:41:11,294 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-16 02:41:11,317 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-16 02:41:11,318 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-16 02:41:11,319 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-16 02:41:11,319 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-16 02:41:11,323 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-16 02:41:11,324 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-16 02:41:11,324 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-16 02:41:11,324 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-16 02:41:11,325 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-16 02:41:11,325 INFO L153 SettingsManager]: * Use SBE=true [2023-12-16 02:41:11,325 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-16 02:41:11,325 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-16 02:41:11,326 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-16 02:41:11,326 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-16 02:41:11,326 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-16 02:41:11,326 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-16 02:41:11,326 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-16 02:41:11,327 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-16 02:41:11,327 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-16 02:41:11,327 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-16 02:41:11,327 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-16 02:41:11,327 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-16 02:41:11,327 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-16 02:41:11,328 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-16 02:41:11,328 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-16 02:41:11,328 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-16 02:41:11,329 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-16 02:41:11,329 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-16 02:41:11,329 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-16 02:41:11,329 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-16 02:41:11,329 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-16 02:41:11,329 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-16 02:41:11,329 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-16 02:41:11,329 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-16 02:41:11,330 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-16 02:41:11,330 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-16 02:41:11,330 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-16 02:41:11,330 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-16 02:41:11,330 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 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Use bitabs translation -> false [2023-12-16 02:41:11,524 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-16 02:41:11,541 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-16 02:41:11,543 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-16 02:41:11,543 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-16 02:41:11,544 INFO L274 PluginConnector]: CDTParser initialized [2023-12-16 02:41:11,544 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/hardness-nfm22/hardness_codestructure_steplocals_file-68.i [2023-12-16 02:41:12,601 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-16 02:41:12,801 INFO L384 CDTParser]: Found 1 translation units. [2023-12-16 02:41:12,802 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_codestructure_steplocals_file-68.i [2023-12-16 02:41:12,810 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/04e81d6d8/f62f556d4a1b4350b16b5cbdae6a9d89/FLAG4563a1546 [2023-12-16 02:41:13,185 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/04e81d6d8/f62f556d4a1b4350b16b5cbdae6a9d89 [2023-12-16 02:41:13,187 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-16 02:41:13,188 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-16 02:41:13,188 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-16 02:41:13,189 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-16 02:41:13,192 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-16 02:41:13,192 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 02:41:13" (1/1) ... [2023-12-16 02:41:13,193 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@24b24a14 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 02:41:13, skipping insertion in model container [2023-12-16 02:41:13,193 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 02:41:13" (1/1) ... [2023-12-16 02:41:13,223 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-16 02:41:13,320 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_codestructure_steplocals_file-68.i[917,930] [2023-12-16 02:41:13,372 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-16 02:41:13,379 INFO L202 MainTranslator]: Completed pre-run [2023-12-16 02:41:13,388 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_codestructure_steplocals_file-68.i[917,930] [2023-12-16 02:41:13,407 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-16 02:41:13,418 INFO L206 MainTranslator]: Completed translation [2023-12-16 02:41:13,418 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 02:41:13 WrapperNode [2023-12-16 02:41:13,418 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-16 02:41:13,419 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-16 02:41:13,419 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-16 02:41:13,419 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-16 02:41:13,424 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 02:41:13" (1/1) ... [2023-12-16 02:41:13,430 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 02:41:13" (1/1) ... [2023-12-16 02:41:13,478 INFO L138 Inliner]: procedures = 26, calls = 29, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 127 [2023-12-16 02:41:13,478 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-16 02:41:13,479 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-16 02:41:13,479 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-16 02:41:13,479 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-16 02:41:13,487 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 02:41:13" (1/1) ... [2023-12-16 02:41:13,487 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 02:41:13" (1/1) ... [2023-12-16 02:41:13,489 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 02:41:13" (1/1) ... [2023-12-16 02:41:13,500 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-16 02:41:13,500 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 02:41:13" (1/1) ... [2023-12-16 02:41:13,500 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 02:41:13" (1/1) ... [2023-12-16 02:41:13,506 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 02:41:13" (1/1) ... [2023-12-16 02:41:13,524 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 02:41:13" (1/1) ... [2023-12-16 02:41:13,526 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 02:41:13" (1/1) ... [2023-12-16 02:41:13,527 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 02:41:13" (1/1) ... [2023-12-16 02:41:13,529 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-16 02:41:13,530 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-16 02:41:13,530 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-16 02:41:13,530 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-16 02:41:13,531 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 02:41:13" (1/1) ... [2023-12-16 02:41:13,540 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-16 02:41:13,548 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-16 02:41:13,574 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-16 02:41:13,617 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-16 02:41:13,633 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-16 02:41:13,633 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-12-16 02:41:13,634 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-12-16 02:41:13,634 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-12-16 02:41:13,634 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-16 02:41:13,634 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-16 02:41:13,714 INFO L241 CfgBuilder]: Building ICFG [2023-12-16 02:41:13,716 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-16 02:41:13,943 INFO L282 CfgBuilder]: Performing block encoding [2023-12-16 02:41:13,980 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-16 02:41:13,981 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-16 02:41:13,981 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 02:41:13 BoogieIcfgContainer [2023-12-16 02:41:13,981 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-16 02:41:13,982 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-16 02:41:13,983 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-16 02:41:13,985 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-16 02:41:13,985 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.12 02:41:13" (1/3) ... [2023-12-16 02:41:13,985 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2bd85b93 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.12 02:41:13, skipping insertion in model container [2023-12-16 02:41:13,985 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 02:41:13" (2/3) ... [2023-12-16 02:41:13,986 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2bd85b93 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.12 02:41:13, skipping insertion in model container [2023-12-16 02:41:13,986 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 02:41:13" (3/3) ... [2023-12-16 02:41:13,986 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_steplocals_file-68.i [2023-12-16 02:41:13,998 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-16 02:41:13,998 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-16 02:41:14,034 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-16 02:41:14,039 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;@54464d6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-16 02:41:14,039 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-16 02:41:14,041 INFO L276 IsEmpty]: Start isEmpty. Operand has 51 states, 32 states have (on average 1.46875) internal successors, (47), 33 states have internal predecessors, (47), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2023-12-16 02:41:14,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2023-12-16 02:41:14,048 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 02:41:14,049 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 02:41:14,049 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 02:41:14,052 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 02:41:14,052 INFO L85 PathProgramCache]: Analyzing trace with hash -1707284963, now seen corresponding path program 1 times [2023-12-16 02:41:14,058 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 02:41:14,058 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [118820415] [2023-12-16 02:41:14,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 02:41:14,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 02:41:14,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 02:41:14,216 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 02:41:14,217 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [118820415] [2023-12-16 02:41:14,217 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unsupported non-linear arithmetic [2023-12-16 02:41:14,218 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [38643741] [2023-12-16 02:41:14,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 02:41:14,218 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-16 02:41:14,218 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-16 02:41:14,220 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-16 02:41:14,224 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-12-16 02:41:14,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 02:41:14,345 INFO L262 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 1 conjunts are in the unsatisfiable core [2023-12-16 02:41:14,350 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 02:41:14,379 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 450 trivial. 0 not checked. [2023-12-16 02:41:14,379 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 02:41:14,379 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [38643741] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 02:41:14,380 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 02:41:14,380 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-16 02:41:14,381 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1396030754] [2023-12-16 02:41:14,381 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 02:41:14,384 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-16 02:41:14,384 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 02:41:14,400 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-16 02:41:14,400 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-16 02:41:14,402 INFO L87 Difference]: Start difference. First operand has 51 states, 32 states have (on average 1.46875) internal successors, (47), 33 states have internal predecessors, (47), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2023-12-16 02:41:14,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 02:41:14,423 INFO L93 Difference]: Finished difference Result 99 states and 172 transitions. [2023-12-16 02:41:14,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-16 02:41:14,425 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) Word has length 103 [2023-12-16 02:41:14,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 02:41:14,430 INFO L225 Difference]: With dead ends: 99 [2023-12-16 02:41:14,430 INFO L226 Difference]: Without dead ends: 49 [2023-12-16 02:41:14,433 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 102 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-16 02:41:14,435 INFO L413 NwaCegarLoop]: 71 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 71 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.0s IncrementalHoareTripleChecker+Time [2023-12-16 02:41:14,435 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 71 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 02:41:14,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2023-12-16 02:41:14,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2023-12-16 02:41:14,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 31 states have (on average 1.3548387096774193) internal successors, (42), 31 states have internal predecessors, (42), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2023-12-16 02:41:14,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 74 transitions. [2023-12-16 02:41:14,462 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 74 transitions. Word has length 103 [2023-12-16 02:41:14,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 02:41:14,462 INFO L495 AbstractCegarLoop]: Abstraction has 49 states and 74 transitions. [2023-12-16 02:41:14,462 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2023-12-16 02:41:14,462 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 74 transitions. [2023-12-16 02:41:14,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2023-12-16 02:41:14,464 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 02:41:14,464 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 02:41:14,471 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2023-12-16 02:41:14,669 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2023-12-16 02:41:14,671 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 02:41:14,672 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 02:41:14,672 INFO L85 PathProgramCache]: Analyzing trace with hash 846452313, now seen corresponding path program 1 times [2023-12-16 02:41:14,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 02:41:14,672 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [581359387] [2023-12-16 02:41:14,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 02:41:14,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 02:41:14,728 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-12-16 02:41:14,731 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1425223014] [2023-12-16 02:41:14,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 02:41:14,731 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-16 02:41:14,731 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-16 02:41:14,740 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-16 02:41:14,744 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-12-16 02:41:14,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 02:41:14,852 INFO L262 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-16 02:41:14,863 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 02:41:14,894 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-12-16 02:41:14,894 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 02:41:14,894 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 02:41:14,894 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [581359387] [2023-12-16 02:41:14,894 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-12-16 02:41:14,894 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1425223014] [2023-12-16 02:41:14,895 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1425223014] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 02:41:14,895 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 02:41:14,895 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-16 02:41:14,895 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [92561978] [2023-12-16 02:41:14,895 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 02:41:14,896 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-16 02:41:14,896 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 02:41:14,896 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-16 02:41:14,897 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-16 02:41:14,897 INFO L87 Difference]: Start difference. First operand 49 states and 74 transitions. Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-12-16 02:41:14,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 02:41:14,913 INFO L93 Difference]: Finished difference Result 97 states and 147 transitions. [2023-12-16 02:41:14,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-16 02:41:14,913 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 103 [2023-12-16 02:41:14,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 02:41:14,919 INFO L225 Difference]: With dead ends: 97 [2023-12-16 02:41:14,919 INFO L226 Difference]: Without dead ends: 49 [2023-12-16 02:41:14,920 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-16 02:41:14,921 INFO L413 NwaCegarLoop]: 69 mSDtfsCounter, 20 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 02:41:14,921 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 117 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 02:41:14,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2023-12-16 02:41:14,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2023-12-16 02:41:14,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 31 states have (on average 1.3225806451612903) internal successors, (41), 31 states have internal predecessors, (41), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2023-12-16 02:41:14,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 73 transitions. [2023-12-16 02:41:14,927 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 73 transitions. Word has length 103 [2023-12-16 02:41:14,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 02:41:14,930 INFO L495 AbstractCegarLoop]: Abstraction has 49 states and 73 transitions. [2023-12-16 02:41:14,930 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-12-16 02:41:14,930 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 73 transitions. [2023-12-16 02:41:14,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2023-12-16 02:41:14,936 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 02:41:14,937 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 02:41:14,944 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-12-16 02:41:15,141 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2023-12-16 02:41:15,142 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 02:41:15,143 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 02:41:15,144 INFO L85 PathProgramCache]: Analyzing trace with hash -114800254, now seen corresponding path program 1 times [2023-12-16 02:41:15,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 02:41:15,146 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2136872744] [2023-12-16 02:41:15,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 02:41:15,147 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 02:41:15,227 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-12-16 02:41:15,227 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [667096150] [2023-12-16 02:41:15,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 02:41:15,228 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-16 02:41:15,228 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-16 02:41:15,231 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-16 02:41:15,293 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-12-16 02:41:15,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 02:41:15,337 INFO L262 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 10 conjunts are in the unsatisfiable core [2023-12-16 02:41:15,344 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 02:41:15,536 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-12-16 02:41:15,536 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 02:41:15,537 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 02:41:15,537 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2136872744] [2023-12-16 02:41:15,537 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-12-16 02:41:15,537 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [667096150] [2023-12-16 02:41:15,537 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [667096150] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 02:41:15,537 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 02:41:15,537 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-16 02:41:15,537 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1085214101] [2023-12-16 02:41:15,537 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 02:41:15,538 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-16 02:41:15,538 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 02:41:15,538 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-16 02:41:15,538 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-12-16 02:41:15,539 INFO L87 Difference]: Start difference. First operand 49 states and 73 transitions. Second operand has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-12-16 02:41:15,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 02:41:15,665 INFO L93 Difference]: Finished difference Result 145 states and 210 transitions. [2023-12-16 02:41:15,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-16 02:41:15,666 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 104 [2023-12-16 02:41:15,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 02:41:15,667 INFO L225 Difference]: With dead ends: 145 [2023-12-16 02:41:15,668 INFO L226 Difference]: Without dead ends: 97 [2023-12-16 02:41:15,668 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2023-12-16 02:41:15,669 INFO L413 NwaCegarLoop]: 73 mSDtfsCounter, 113 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 145 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-16 02:41:15,670 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 145 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-16 02:41:15,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2023-12-16 02:41:15,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 55. [2023-12-16 02:41:15,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 36 states have (on average 1.2777777777777777) internal successors, (46), 36 states have internal predecessors, (46), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2023-12-16 02:41:15,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 78 transitions. [2023-12-16 02:41:15,682 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 78 transitions. Word has length 104 [2023-12-16 02:41:15,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 02:41:15,682 INFO L495 AbstractCegarLoop]: Abstraction has 55 states and 78 transitions. [2023-12-16 02:41:15,684 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-12-16 02:41:15,684 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 78 transitions. [2023-12-16 02:41:15,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2023-12-16 02:41:15,686 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 02:41:15,686 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 02:41:15,704 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-12-16 02:41:15,891 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-16 02:41:15,894 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 02:41:15,894 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 02:41:15,894 INFO L85 PathProgramCache]: Analyzing trace with hash -924146880, now seen corresponding path program 1 times [2023-12-16 02:41:15,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 02:41:15,895 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1680671655] [2023-12-16 02:41:15,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 02:41:15,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 02:41:15,917 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-12-16 02:41:15,918 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [427516969] [2023-12-16 02:41:15,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 02:41:15,918 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-16 02:41:15,918 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-16 02:41:15,930 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-16 02:41:15,967 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-12-16 02:41:16,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 02:41:16,035 INFO L262 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-16 02:41:16,037 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 02:41:16,122 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 253 proven. 24 refuted. 0 times theorem prover too weak. 203 trivial. 0 not checked. [2023-12-16 02:41:16,123 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 02:41:16,232 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 21 proven. 24 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2023-12-16 02:41:16,232 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 02:41:16,232 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1680671655] [2023-12-16 02:41:16,232 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-12-16 02:41:16,232 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [427516969] [2023-12-16 02:41:16,232 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [427516969] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-16 02:41:16,232 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-16 02:41:16,233 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2023-12-16 02:41:16,233 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1260269577] [2023-12-16 02:41:16,233 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-16 02:41:16,234 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-16 02:41:16,235 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 02:41:16,235 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-16 02:41:16,236 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-12-16 02:41:16,237 INFO L87 Difference]: Start difference. First operand 55 states and 78 transitions. Second operand has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 7 states have internal predecessors, (36), 2 states have call successors, (24), 2 states have call predecessors, (24), 4 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2023-12-16 02:41:16,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 02:41:16,354 INFO L93 Difference]: Finished difference Result 115 states and 159 transitions. [2023-12-16 02:41:16,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-16 02:41:16,355 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 7 states have internal predecessors, (36), 2 states have call successors, (24), 2 states have call predecessors, (24), 4 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) Word has length 104 [2023-12-16 02:41:16,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 02:41:16,358 INFO L225 Difference]: With dead ends: 115 [2023-12-16 02:41:16,358 INFO L226 Difference]: Without dead ends: 61 [2023-12-16 02:41:16,361 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 210 GetRequests, 200 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2023-12-16 02:41:16,362 INFO L413 NwaCegarLoop]: 46 mSDtfsCounter, 59 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 106 SdHoareTripleChecker+Invalid, 122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-16 02:41:16,363 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 106 Invalid, 122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-16 02:41:16,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2023-12-16 02:41:16,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 57. [2023-12-16 02:41:16,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 37 states have (on average 1.2162162162162162) internal successors, (45), 37 states have internal predecessors, (45), 16 states have call successors, (16), 3 states have call predecessors, (16), 3 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2023-12-16 02:41:16,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 77 transitions. [2023-12-16 02:41:16,378 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 77 transitions. Word has length 104 [2023-12-16 02:41:16,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 02:41:16,379 INFO L495 AbstractCegarLoop]: Abstraction has 57 states and 77 transitions. [2023-12-16 02:41:16,379 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 7 states have internal predecessors, (36), 2 states have call successors, (24), 2 states have call predecessors, (24), 4 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2023-12-16 02:41:16,379 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 77 transitions. [2023-12-16 02:41:16,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2023-12-16 02:41:16,380 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 02:41:16,380 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 02:41:16,388 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-12-16 02:41:16,586 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-16 02:41:16,586 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 02:41:16,587 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 02:41:16,588 INFO L85 PathProgramCache]: Analyzing trace with hash 1040649762, now seen corresponding path program 1 times [2023-12-16 02:41:16,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 02:41:16,588 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1905215656] [2023-12-16 02:41:16,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 02:41:16,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 02:41:16,621 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-12-16 02:41:16,621 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [266480122] [2023-12-16 02:41:16,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 02:41:16,621 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-16 02:41:16,621 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-16 02:41:16,633 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-16 02:41:16,676 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-12-16 02:41:16,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-16 02:41:16,727 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-16 02:41:16,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-16 02:41:16,830 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-12-16 02:41:16,830 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-12-16 02:41:16,831 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-16 02:41:16,839 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-12-16 02:41:17,037 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-16 02:41:17,040 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2023-12-16 02:41:17,042 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-16 02:41:17,120 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.12 02:41:17 BoogieIcfgContainer [2023-12-16 02:41:17,120 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-16 02:41:17,121 INFO L158 Benchmark]: Toolchain (without parser) took 3933.09ms. Allocated memory is still 244.3MB. Free memory was 201.0MB in the beginning and 200.1MB in the end (delta: 890.7kB). Peak memory consumption was 122.0MB. Max. memory is 8.0GB. [2023-12-16 02:41:17,121 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 168.8MB. Free memory is still 118.8MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-16 02:41:17,121 INFO L158 Benchmark]: CACSL2BoogieTranslator took 230.19ms. Allocated memory is still 244.3MB. Free memory was 201.0MB in the beginning and 187.4MB in the end (delta: 13.6MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. [2023-12-16 02:41:17,121 INFO L158 Benchmark]: Boogie Procedure Inliner took 59.22ms. Allocated memory is still 244.3MB. Free memory was 187.4MB in the beginning and 183.7MB in the end (delta: 3.7MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2023-12-16 02:41:17,121 INFO L158 Benchmark]: Boogie Preprocessor took 50.45ms. Allocated memory is still 244.3MB. Free memory was 183.7MB in the beginning and 179.0MB in the end (delta: 4.7MB). Peak memory consumption was 5.2MB. Max. memory is 8.0GB. [2023-12-16 02:41:17,122 INFO L158 Benchmark]: RCFGBuilder took 451.23ms. Allocated memory is still 244.3MB. Free memory was 179.0MB in the beginning and 155.4MB in the end (delta: 23.6MB). Peak memory consumption was 23.1MB. Max. memory is 8.0GB. [2023-12-16 02:41:17,122 INFO L158 Benchmark]: TraceAbstraction took 3137.90ms. Allocated memory is still 244.3MB. Free memory was 154.9MB in the beginning and 200.1MB in the end (delta: -45.2MB). Peak memory consumption was 75.9MB. Max. memory is 8.0GB. [2023-12-16 02:41:17,123 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.09ms. Allocated memory is still 168.8MB. Free memory is still 118.8MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 230.19ms. Allocated memory is still 244.3MB. Free memory was 201.0MB in the beginning and 187.4MB in the end (delta: 13.6MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 59.22ms. Allocated memory is still 244.3MB. Free memory was 187.4MB in the beginning and 183.7MB in the end (delta: 3.7MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 50.45ms. Allocated memory is still 244.3MB. Free memory was 183.7MB in the beginning and 179.0MB in the end (delta: 4.7MB). Peak memory consumption was 5.2MB. Max. memory is 8.0GB. * RCFGBuilder took 451.23ms. Allocated memory is still 244.3MB. Free memory was 179.0MB in the beginning and 155.4MB in the end (delta: 23.6MB). Peak memory consumption was 23.1MB. Max. memory is 8.0GB. * TraceAbstraction took 3137.90ms. Allocated memory is still 244.3MB. Free memory was 154.9MB in the beginning and 200.1MB in the end (delta: -45.2MB). Peak memory consumption was 75.9MB. 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 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 118, overapproximation of someBinaryFLOATComparisonOperation at line 118, overapproximation of bitwise operation at line 42. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned char var_1_1 = 1; [L23] unsigned char var_1_2 = 10; [L24] unsigned char var_1_3 = 25; [L25] unsigned char var_1_4 = 16; [L26] unsigned char var_1_5 = 0; [L27] unsigned char var_1_6 = 0; [L28] unsigned char var_1_7 = 1; [L29] unsigned char var_1_8 = 32; [L30] double var_1_9 = 4.6; [L31] double var_1_10 = 9.25; [L32] double var_1_11 = 1.25; [L33] unsigned char var_1_12 = 100; [L34] unsigned char var_1_13 = 64; [L35] unsigned char var_1_14 = 0; [L36] float var_1_15 = 7.5; [L37] signed long int var_1_16 = 0; [L122] isInitial = 1 [L123] FCALL initially() [L124] COND TRUE 1 [L125] FCALL updateLastVariables() [L126] CALL updateVariables() [L90] var_1_2 = __VERIFIER_nondet_uchar() [L91] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=37/4, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_1=1, var_1_3=25, var_1_4=16, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=32, var_1_9=23/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=37/4, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_1=1, var_1_3=25, var_1_4=16, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=32, var_1_9=23/5] [L91] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, var_1_10=37/4, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_1=1, var_1_3=25, var_1_4=16, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=32, var_1_9=23/5] [L92] CALL assume_abort_if_not(var_1_2 <= 255) VAL [\old(cond)=1, isInitial=1, var_1_10=37/4, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_1=1, var_1_3=25, var_1_4=16, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=32, var_1_9=23/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=37/4, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_1=1, var_1_3=25, var_1_4=16, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=32, var_1_9=23/5] [L92] RET assume_abort_if_not(var_1_2 <= 255) VAL [isInitial=1, var_1_10=37/4, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_1=1, var_1_3=25, var_1_4=16, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=32, var_1_9=23/5] [L93] var_1_3 = __VERIFIER_nondet_uchar() [L94] CALL assume_abort_if_not(var_1_3 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=37/4, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_1=1, var_1_4=16, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=32, var_1_9=23/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=37/4, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_1=1, var_1_4=16, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=32, var_1_9=23/5] [L94] RET assume_abort_if_not(var_1_3 >= 0) VAL [isInitial=1, var_1_10=37/4, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_1=1, var_1_4=16, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=32, var_1_9=23/5] [L95] CALL assume_abort_if_not(var_1_3 <= 255) VAL [\old(cond)=1, isInitial=1, var_1_10=37/4, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_1=1, var_1_4=16, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=32, var_1_9=23/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=37/4, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_1=1, var_1_4=16, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=32, var_1_9=23/5] [L95] RET assume_abort_if_not(var_1_3 <= 255) VAL [isInitial=1, var_1_10=37/4, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_1=1, var_1_4=16, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=32, var_1_9=23/5] [L96] var_1_4 = __VERIFIER_nondet_uchar() [L97] CALL assume_abort_if_not(var_1_4 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=37/4, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_1=1, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=32, var_1_9=23/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=37/4, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_1=1, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=32, var_1_9=23/5] [L97] RET assume_abort_if_not(var_1_4 >= 0) VAL [isInitial=1, var_1_10=37/4, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_1=1, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=32, var_1_9=23/5] [L98] CALL assume_abort_if_not(var_1_4 <= 255) VAL [\old(cond)=1, isInitial=1, var_1_10=37/4, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_1=1, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=32, var_1_9=23/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=37/4, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_1=1, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=32, var_1_9=23/5] [L98] RET assume_abort_if_not(var_1_4 <= 255) VAL [isInitial=1, var_1_10=37/4, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_1=1, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=32, var_1_9=23/5] [L99] var_1_5 = __VERIFIER_nondet_uchar() [L100] CALL assume_abort_if_not(var_1_5 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=37/4, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_1=1, var_1_6=0, var_1_7=1, var_1_8=32, var_1_9=23/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=37/4, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_1=1, var_1_6=0, var_1_7=1, var_1_8=32, var_1_9=23/5] [L100] RET assume_abort_if_not(var_1_5 >= 0) VAL [isInitial=1, var_1_10=37/4, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_1=1, var_1_6=0, var_1_7=1, var_1_8=32, var_1_9=23/5] [L101] CALL assume_abort_if_not(var_1_5 <= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=37/4, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_1=1, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=32, var_1_9=23/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=37/4, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_1=1, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=32, var_1_9=23/5] [L101] RET assume_abort_if_not(var_1_5 <= 0) VAL [isInitial=1, var_1_10=37/4, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_1=1, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=32, var_1_9=23/5] [L102] var_1_7 = __VERIFIER_nondet_uchar() [L103] CALL assume_abort_if_not(var_1_7 >= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=37/4, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_1=1, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=32, var_1_9=23/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=37/4, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_1=1, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=32, var_1_9=23/5] [L103] RET assume_abort_if_not(var_1_7 >= 1) VAL [isInitial=1, var_1_10=37/4, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_1=1, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=32, var_1_9=23/5] [L104] CALL assume_abort_if_not(var_1_7 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=37/4, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_1=1, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=32, var_1_9=23/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=37/4, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_1=1, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=32, var_1_9=23/5] [L104] RET assume_abort_if_not(var_1_7 <= 1) VAL [isInitial=1, var_1_10=37/4, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_1=1, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=32, var_1_9=23/5] [L105] var_1_8 = __VERIFIER_nondet_uchar() [L106] CALL assume_abort_if_not(var_1_8 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=37/4, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_1=1, var_1_5=0, var_1_6=0, var_1_7=1, var_1_9=23/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=37/4, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_1=1, var_1_5=0, var_1_6=0, var_1_7=1, var_1_9=23/5] [L106] RET assume_abort_if_not(var_1_8 >= 0) VAL [isInitial=1, var_1_10=37/4, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_1=1, var_1_5=0, var_1_6=0, var_1_7=1, var_1_9=23/5] [L107] CALL assume_abort_if_not(var_1_8 <= 255) VAL [\old(cond)=1, isInitial=1, var_1_10=37/4, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_1=1, var_1_5=0, var_1_6=0, var_1_7=1, var_1_9=23/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=37/4, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_1=1, var_1_5=0, var_1_6=0, var_1_7=1, var_1_9=23/5] [L107] RET assume_abort_if_not(var_1_8 <= 255) VAL [isInitial=1, var_1_10=37/4, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_1=1, var_1_5=0, var_1_6=0, var_1_7=1, var_1_9=23/5] [L108] CALL assume_abort_if_not(var_1_8 != 0) VAL [\old(cond)=1, isInitial=1, var_1_10=37/4, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_1=1, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=1, var_1_9=23/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=37/4, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_1=1, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=1, var_1_9=23/5] [L108] RET assume_abort_if_not(var_1_8 != 0) VAL [isInitial=1, var_1_10=37/4, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_1=1, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=1, var_1_9=23/5] [L109] var_1_10 = __VERIFIER_nondet_double() [L110] CALL assume_abort_if_not((var_1_10 >= -922337.2036854765600e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 9223372.036854765600e+12F && var_1_10 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_1=1, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=1, var_1_9=23/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_1=1, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=1, var_1_9=23/5] [L110] RET assume_abort_if_not((var_1_10 >= -922337.2036854765600e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 9223372.036854765600e+12F && var_1_10 >= 1.0e-20F )) VAL [isInitial=1, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_1=1, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=1, var_1_9=23/5] [L111] var_1_13 = __VERIFIER_nondet_uchar() [L112] CALL assume_abort_if_not(var_1_13 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_11=5/4, var_1_12=100, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_1=1, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=1, var_1_9=23/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_11=5/4, var_1_12=100, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_1=1, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=1, var_1_9=23/5] [L112] RET assume_abort_if_not(var_1_13 >= 0) VAL [isInitial=1, var_1_11=5/4, var_1_12=100, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_1=1, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=1, var_1_9=23/5] [L113] CALL assume_abort_if_not(var_1_13 <= 254) VAL [\old(cond)=1, isInitial=1, var_1_11=5/4, var_1_12=100, var_1_13=49, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_1=1, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=1, var_1_9=23/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_11=5/4, var_1_12=100, var_1_13=49, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_1=1, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=1, var_1_9=23/5] [L113] RET assume_abort_if_not(var_1_13 <= 254) VAL [isInitial=1, var_1_11=5/4, var_1_12=100, var_1_13=49, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_1=1, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=1, var_1_9=23/5] [L126] RET updateVariables() [L127] CALL step() [L41] unsigned char stepLocal_0 = var_1_2; [L42] EXPR var_1_3 ^ var_1_4 VAL [isInitial=1, stepLocal_0=48, var_1_11=5/4, var_1_12=100, var_1_13=49, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_1=1, var_1_2=48, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=1, var_1_9=23/5] [L42] COND TRUE stepLocal_0 <= (var_1_3 ^ var_1_4) [L43] var_1_1 = (! var_1_5) VAL [isInitial=1, stepLocal_0=48, var_1_11=5/4, var_1_12=100, var_1_13=49, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_1=1, var_1_2=48, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=1, var_1_9=23/5] [L47] unsigned char stepLocal_2 = (var_1_5 && var_1_7) && var_1_1; [L48] signed long int stepLocal_1 = -256; VAL [isInitial=1, stepLocal_0=48, stepLocal_1=-256, stepLocal_2=0, var_1_11=5/4, var_1_12=100, var_1_13=49, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_1=1, var_1_2=48, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=1, var_1_9=23/5] [L49] COND FALSE !(stepLocal_1 >= var_1_3) VAL [isInitial=1, stepLocal_0=48, stepLocal_1=-256, stepLocal_2=0, var_1_11=5/4, var_1_12=100, var_1_13=49, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_1=1, var_1_2=48, var_1_3=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=1, var_1_9=23/5] [L52] COND TRUE (var_1_2 < (var_1_4 / var_1_8)) || stepLocal_2 [L53] var_1_6 = var_1_7 VAL [isInitial=1, stepLocal_0=48, stepLocal_1=-256, stepLocal_2=0, var_1_11=5/4, var_1_12=100, var_1_13=49, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_1=1, var_1_2=48, var_1_3=0, var_1_4=49, var_1_5=0, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=23/5] [L56] COND TRUE ((((((((var_1_2) < (var_1_3)) ? (var_1_2) : (var_1_3)))) > (var_1_4)) ? (((((var_1_2) < (var_1_3)) ? (var_1_2) : (var_1_3)))) : (var_1_4))) <= (50 * var_1_8) [L57] var_1_9 = var_1_10 VAL [isInitial=1, stepLocal_0=48, stepLocal_1=-256, stepLocal_2=0, var_1_10=2, var_1_11=5/4, var_1_12=100, var_1_13=49, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_1=1, var_1_2=48, var_1_3=0, var_1_4=49, var_1_5=0, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=2] [L59] unsigned char stepLocal_3 = var_1_7 && var_1_1; VAL [isInitial=1, stepLocal_0=48, stepLocal_1=-256, stepLocal_2=0, stepLocal_3=1, var_1_10=2, var_1_11=5/4, var_1_12=100, var_1_13=49, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_1=1, var_1_2=48, var_1_3=0, var_1_4=49, var_1_5=0, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=2] [L60] COND TRUE stepLocal_3 || (! var_1_5) [L61] var_1_11 = var_1_10 VAL [isInitial=1, stepLocal_0=48, stepLocal_1=-256, stepLocal_2=0, stepLocal_3=1, var_1_10=2, var_1_11=2, var_1_12=100, var_1_13=49, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_1=1, var_1_2=48, var_1_3=0, var_1_4=49, var_1_5=0, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=2] [L63] unsigned char stepLocal_4 = var_1_3; VAL [isInitial=1, stepLocal_0=48, stepLocal_1=-256, stepLocal_2=0, stepLocal_3=1, stepLocal_4=0, var_1_10=2, var_1_11=2, var_1_12=100, var_1_13=49, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_1=1, var_1_2=48, var_1_3=0, var_1_4=49, var_1_5=0, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=2] [L64] COND TRUE \read(var_1_1) VAL [isInitial=1, stepLocal_0=48, stepLocal_1=-256, stepLocal_2=0, stepLocal_3=1, stepLocal_4=0, var_1_10=2, var_1_11=2, var_1_12=100, var_1_13=49, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_1=1, var_1_2=48, var_1_3=0, var_1_4=49, var_1_5=0, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=2] [L65] COND FALSE !(var_1_10 >= (- var_1_9)) [L72] var_1_12 = var_1_13 VAL [isInitial=1, stepLocal_0=48, stepLocal_1=-256, stepLocal_2=0, stepLocal_3=1, stepLocal_4=0, var_1_10=2, var_1_11=2, var_1_12=49, var_1_13=49, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_1=1, var_1_2=48, var_1_3=0, var_1_4=49, var_1_5=0, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=2] [L77] unsigned char stepLocal_6 = var_1_2; [L78] signed long int stepLocal_5 = var_1_13 + 16; VAL [isInitial=1, stepLocal_0=48, stepLocal_1=-256, stepLocal_2=0, stepLocal_3=1, stepLocal_4=0, stepLocal_5=65, stepLocal_6=48, var_1_10=2, var_1_11=2, var_1_12=49, var_1_13=49, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_1=1, var_1_2=48, var_1_3=0, var_1_4=49, var_1_5=0, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=2] [L79] COND FALSE !((var_1_13 % (5u + 256u)) <= stepLocal_6) VAL [isInitial=1, stepLocal_0=48, stepLocal_1=-256, stepLocal_2=0, stepLocal_3=1, stepLocal_4=0, stepLocal_5=65, stepLocal_6=48, var_1_10=2, var_1_11=2, var_1_12=49, var_1_13=49, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_1=1, var_1_2=48, var_1_3=0, var_1_4=49, var_1_5=0, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=2] [L86] var_1_15 = var_1_10 [L87] var_1_16 = var_1_3 [L127] RET step() [L128] CALL, EXPR property() [L118] EXPR var_1_3 ^ var_1_4 [L118-L119] return ((((((((var_1_2 <= (var_1_3 ^ var_1_4)) ? (var_1_1 == ((unsigned char) (! var_1_5))) : (var_1_1 == ((unsigned char) (! var_1_5)))) && ((-256 >= var_1_3) ? (var_1_6 == ((unsigned char) (var_1_1 || var_1_7))) : (((var_1_2 < (var_1_4 / var_1_8)) || ((var_1_5 && var_1_7) && var_1_1)) ? (var_1_6 == ((unsigned char) var_1_7)) : 1))) && ((((((((((var_1_2) < (var_1_3)) ? (var_1_2) : (var_1_3)))) > (var_1_4)) ? (((((var_1_2) < (var_1_3)) ? (var_1_2) : (var_1_3)))) : (var_1_4))) <= (50 * var_1_8)) ? (var_1_9 == ((double) var_1_10)) : 1)) && (((var_1_7 && var_1_1) || (! var_1_5)) ? (var_1_11 == ((double) var_1_10)) : 1)) && (var_1_1 ? ((var_1_10 >= (- var_1_9)) ? ((var_1_8 != var_1_3) ? (var_1_12 == ((unsigned char) var_1_13)) : (var_1_12 == ((unsigned char) 50))) : (var_1_12 == ((unsigned char) var_1_13))) : (var_1_12 == ((unsigned char) var_1_13)))) && (((var_1_13 % (5u + 256u)) <= var_1_2) ? (((var_1_13 + 16) >= var_1_2) ? (var_1_14 == ((unsigned char) var_1_7)) : (var_1_14 == ((unsigned char) var_1_7))) : 1)) && (var_1_15 == ((float) var_1_10))) && (var_1_16 == ((signed long int) var_1_3)) ; [L128] RET, EXPR property() [L128] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [\old(cond)=0, cond=0, isInitial=1, var_1_10=2, var_1_11=2, var_1_12=49, var_1_13=49, var_1_14=0, var_1_15=2, var_1_16=0, var_1_1=1, var_1_2=48, var_1_3=0, var_1_4=49, var_1_5=0, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=2] [L19] reach_error() VAL [\old(cond)=0, cond=0, isInitial=1, var_1_10=2, var_1_11=2, var_1_12=49, var_1_13=49, var_1_14=0, var_1_15=2, var_1_16=0, var_1_1=1, var_1_2=48, var_1_3=0, var_1_4=49, var_1_5=0, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 51 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 3.0s, OverallIterations: 5, TraceHistogramMax: 16, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 198 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 192 mSDsluCounter, 439 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 180 mSDsCounter, 47 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 185 IncrementalHoareTripleChecker+Invalid, 232 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 47 mSolverCounterUnsat, 259 mSDtfsCounter, 185 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 520 GetRequests, 504 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=57occurred in iteration=4, InterpolantAutomatonStates: 21, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 46 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 622 NumberOfCodeBlocks, 622 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 513 ConstructedInterpolants, 0 QuantifiedInterpolants, 976 SizeOfPredicates, 9 NumberOfNonLiveVariables, 1038 ConjunctsInSsa, 19 ConjunctsInUnsatCore, 5 InterpolantComputations, 3 PerfectInterpolantSequences, 2352/2400 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: unable to determine feasibility of some traces [2023-12-16 02:41:17,152 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 Received shutdown request...