/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 true -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/hardness-nfm22/hardness_operatoramount_amount10_file-4.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-15 21:06:36,282 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-15 21:06:36,342 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-15 21:06:36,346 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-15 21:06:36,347 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-15 21:06:36,369 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-15 21:06:36,369 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-15 21:06:36,369 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-15 21:06:36,370 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-15 21:06:36,373 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-15 21:06:36,373 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-15 21:06:36,374 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-15 21:06:36,374 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-15 21:06:36,375 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-15 21:06:36,375 INFO L153 SettingsManager]: * Use SBE=true [2023-12-15 21:06:36,375 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-15 21:06:36,375 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-15 21:06:36,376 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-15 21:06:36,376 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-15 21:06:36,377 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-15 21:06:36,377 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-15 21:06:36,377 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-15 21:06:36,377 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-15 21:06:36,377 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-15 21:06:36,378 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-15 21:06:36,378 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-15 21:06:36,378 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-15 21:06:36,378 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-15 21:06:36,378 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-15 21:06:36,378 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-15 21:06:36,379 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-15 21:06:36,379 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-15 21:06:36,379 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-15 21:06:36,380 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-15 21:06:36,380 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-15 21:06:36,380 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-15 21:06:36,380 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-15 21:06:36,380 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-15 21:06:36,380 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-15 21:06:36,380 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-15 21:06:36,380 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-15 21:06:36,381 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-15 21:06:36,381 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-15 21:06:36,381 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 -> true [2023-12-15 21:06:36,568 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-15 21:06:36,585 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-15 21:06:36,587 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-15 21:06:36,588 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-15 21:06:36,588 INFO L274 PluginConnector]: CDTParser initialized [2023-12-15 21:06:36,589 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/hardness-nfm22/hardness_operatoramount_amount10_file-4.i [2023-12-15 21:06:37,608 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-15 21:06:37,767 INFO L384 CDTParser]: Found 1 translation units. [2023-12-15 21:06:37,767 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_operatoramount_amount10_file-4.i [2023-12-15 21:06:37,772 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2adce395a/01b92785fac24ba690dd72ad49fefffe/FLAG3f394b78d [2023-12-15 21:06:37,783 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2adce395a/01b92785fac24ba690dd72ad49fefffe [2023-12-15 21:06:37,785 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-15 21:06:37,786 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-15 21:06:37,788 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-15 21:06:37,788 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-15 21:06:37,791 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-15 21:06:37,792 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.12 09:06:37" (1/1) ... [2023-12-15 21:06:37,792 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4a1a8b77 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:06:37, skipping insertion in model container [2023-12-15 21:06:37,792 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.12 09:06:37" (1/1) ... [2023-12-15 21:06:37,812 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-15 21:06:37,931 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_operatoramount_amount10_file-4.i[914,927] [2023-12-15 21:06:37,951 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-15 21:06:37,959 INFO L202 MainTranslator]: Completed pre-run [2023-12-15 21:06:37,967 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_operatoramount_amount10_file-4.i[914,927] [2023-12-15 21:06:37,973 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-15 21:06:37,983 INFO L206 MainTranslator]: Completed translation [2023-12-15 21:06:37,984 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:06:37 WrapperNode [2023-12-15 21:06:37,984 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-15 21:06:37,984 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-15 21:06:37,985 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-15 21:06:37,985 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-15 21:06:37,989 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:06:37" (1/1) ... [2023-12-15 21:06:37,993 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:06:37" (1/1) ... [2023-12-15 21:06:38,012 INFO L138 Inliner]: procedures = 26, calls = 20, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 68 [2023-12-15 21:06:38,013 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-15 21:06:38,013 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-15 21:06:38,013 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-15 21:06:38,013 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-15 21:06:38,021 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:06:37" (1/1) ... [2023-12-15 21:06:38,021 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:06:37" (1/1) ... [2023-12-15 21:06:38,028 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:06:37" (1/1) ... [2023-12-15 21:06:38,039 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-15 21:06:38,040 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:06:37" (1/1) ... [2023-12-15 21:06:38,040 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:06:37" (1/1) ... [2023-12-15 21:06:38,050 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:06:37" (1/1) ... [2023-12-15 21:06:38,052 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:06:37" (1/1) ... [2023-12-15 21:06:38,056 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:06:37" (1/1) ... [2023-12-15 21:06:38,057 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:06:37" (1/1) ... [2023-12-15 21:06:38,060 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-15 21:06:38,061 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-15 21:06:38,061 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-15 21:06:38,061 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-15 21:06:38,061 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:06:37" (1/1) ... [2023-12-15 21:06:38,066 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-15 21:06:38,073 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-15 21:06:38,096 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-15 21:06:38,104 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-15 21:06:38,118 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-15 21:06:38,119 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-12-15 21:06:38,119 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-12-15 21:06:38,119 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-12-15 21:06:38,119 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-15 21:06:38,119 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-15 21:06:38,195 INFO L241 CfgBuilder]: Building ICFG [2023-12-15 21:06:38,199 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-15 21:06:38,341 INFO L282 CfgBuilder]: Performing block encoding [2023-12-15 21:06:38,370 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-15 21:06:38,370 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-15 21:06:38,370 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.12 09:06:38 BoogieIcfgContainer [2023-12-15 21:06:38,370 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-15 21:06:38,372 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-15 21:06:38,372 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-15 21:06:38,374 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-15 21:06:38,374 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.12 09:06:37" (1/3) ... [2023-12-15 21:06:38,374 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b7d1983 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.12 09:06:38, skipping insertion in model container [2023-12-15 21:06:38,375 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:06:37" (2/3) ... [2023-12-15 21:06:38,375 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b7d1983 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.12 09:06:38, skipping insertion in model container [2023-12-15 21:06:38,375 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.12 09:06:38" (3/3) ... [2023-12-15 21:06:38,376 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount10_file-4.i [2023-12-15 21:06:38,388 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-15 21:06:38,388 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-15 21:06:38,427 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-15 21:06:38,432 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;@a91334d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-15 21:06:38,433 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-15 21:06:38,436 INFO L276 IsEmpty]: Start isEmpty. Operand has 25 states, 15 states have (on average 1.4) internal successors, (21), 16 states have internal predecessors, (21), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2023-12-15 21:06:38,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2023-12-15 21:06:38,441 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:06:38,442 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 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-15 21:06:38,442 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:06:38,445 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:06:38,445 INFO L85 PathProgramCache]: Analyzing trace with hash -965972443, now seen corresponding path program 1 times [2023-12-15 21:06:38,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:06:38,452 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1125490240] [2023-12-15 21:06:38,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:06:38,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:06:38,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:06:38,608 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 21:06:38,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:06:38,619 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-15 21:06:38,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:06:38,633 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-15 21:06:38,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:06:38,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-15 21:06:38,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:06:38,645 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-15 21:06:38,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:06:38,651 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-15 21:06:38,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:06:38,658 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-15 21:06:38,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:06:38,668 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2023-12-15 21:06:38,669 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:06:38,669 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1125490240] [2023-12-15 21:06:38,669 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1125490240] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 21:06:38,669 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 21:06:38,670 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-15 21:06:38,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [525662937] [2023-12-15 21:06:38,671 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 21:06:38,675 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-15 21:06:38,675 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:06:38,699 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-15 21:06:38,700 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-15 21:06:38,701 INFO L87 Difference]: Start difference. First operand has 25 states, 15 states have (on average 1.4) internal successors, (21), 16 states have internal predecessors, (21), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 2 states have call successors, (7) [2023-12-15 21:06:38,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:06:38,737 INFO L93 Difference]: Finished difference Result 47 states and 75 transitions. [2023-12-15 21:06:38,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-15 21:06:38,739 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 2 states have call successors, (7) Word has length 45 [2023-12-15 21:06:38,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:06:38,743 INFO L225 Difference]: With dead ends: 47 [2023-12-15 21:06:38,743 INFO L226 Difference]: Without dead ends: 23 [2023-12-15 21:06:38,746 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 23 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-15 21:06:38,749 INFO L413 NwaCegarLoop]: 27 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, 27 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-15 21:06:38,750 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 27 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-15 21:06:38,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2023-12-15 21:06:38,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2023-12-15 21:06:38,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 14 states have internal predecessors, (16), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2023-12-15 21:06:38,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 30 transitions. [2023-12-15 21:06:38,782 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 30 transitions. Word has length 45 [2023-12-15 21:06:38,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:06:38,783 INFO L495 AbstractCegarLoop]: Abstraction has 23 states and 30 transitions. [2023-12-15 21:06:38,783 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 2 states have call successors, (7) [2023-12-15 21:06:38,783 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 30 transitions. [2023-12-15 21:06:38,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2023-12-15 21:06:38,786 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:06:38,786 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 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-15 21:06:38,786 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-15 21:06:38,786 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:06:38,789 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:06:38,789 INFO L85 PathProgramCache]: Analyzing trace with hash 12048035, now seen corresponding path program 1 times [2023-12-15 21:06:38,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:06:38,789 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1618014181] [2023-12-15 21:06:38,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:06:38,790 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:06:38,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-15 21:06:38,861 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-15 21:06:38,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-15 21:06:38,938 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-12-15 21:06:38,938 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-12-15 21:06:38,939 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-15 21:06:38,940 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-15 21:06:38,942 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1] [2023-12-15 21:06:38,947 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-15 21:06:38,985 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.12 09:06:38 BoogieIcfgContainer [2023-12-15 21:06:38,985 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-15 21:06:38,986 INFO L158 Benchmark]: Toolchain (without parser) took 1200.10ms. Allocated memory is still 167.8MB. Free memory was 111.6MB in the beginning and 94.4MB in the end (delta: 17.3MB). Peak memory consumption was 18.2MB. Max. memory is 8.0GB. [2023-12-15 21:06:38,986 INFO L158 Benchmark]: CDTParser took 0.43ms. Allocated memory is still 167.8MB. Free memory is still 115.2MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-15 21:06:38,986 INFO L158 Benchmark]: CACSL2BoogieTranslator took 196.27ms. Allocated memory is still 167.8MB. Free memory was 111.4MB in the beginning and 100.1MB in the end (delta: 11.3MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2023-12-15 21:06:38,987 INFO L158 Benchmark]: Boogie Procedure Inliner took 28.38ms. Allocated memory is still 167.8MB. Free memory was 100.1MB in the beginning and 97.9MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-15 21:06:38,987 INFO L158 Benchmark]: Boogie Preprocessor took 46.72ms. Allocated memory is still 167.8MB. Free memory was 97.9MB in the beginning and 96.0MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-15 21:06:38,987 INFO L158 Benchmark]: RCFGBuilder took 309.63ms. Allocated memory is still 167.8MB. Free memory was 96.0MB in the beginning and 130.0MB in the end (delta: -34.0MB). Peak memory consumption was 11.9MB. Max. memory is 8.0GB. [2023-12-15 21:06:38,988 INFO L158 Benchmark]: TraceAbstraction took 613.92ms. Allocated memory is still 167.8MB. Free memory was 129.5MB in the beginning and 94.4MB in the end (delta: 35.1MB). Peak memory consumption was 35.7MB. Max. memory is 8.0GB. [2023-12-15 21:06:38,990 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.43ms. Allocated memory is still 167.8MB. Free memory is still 115.2MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 196.27ms. Allocated memory is still 167.8MB. Free memory was 111.4MB in the beginning and 100.1MB in the end (delta: 11.3MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 28.38ms. Allocated memory is still 167.8MB. Free memory was 100.1MB in the beginning and 97.9MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 46.72ms. Allocated memory is still 167.8MB. Free memory was 97.9MB in the beginning and 96.0MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 309.63ms. Allocated memory is still 167.8MB. Free memory was 96.0MB in the beginning and 130.0MB in the end (delta: -34.0MB). Peak memory consumption was 11.9MB. Max. memory is 8.0GB. * TraceAbstraction took 613.92ms. Allocated memory is still 167.8MB. Free memory was 129.5MB in the beginning and 94.4MB in the end (delta: 35.1MB). Peak memory consumption was 35.7MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - 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 someBinaryFLOATComparisonOperation at line 56. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed long int var_1_1 = -16; [L23] signed short int var_1_2 = 16; [L24] signed short int var_1_3 = 25; [L25] signed long int var_1_4 = -32; [L26] unsigned char var_1_5 = 1; [L27] float var_1_6 = 0.6599999999999999; [L28] float var_1_7 = 256.6; [L60] isInitial = 1 [L61] FCALL initially() [L62] COND TRUE 1 [L63] FCALL updateLastVariables() [L64] CALL updateVariables() [L41] var_1_2 = __VERIFIER_nondet_short() [L42] CALL assume_abort_if_not(var_1_2 >= -32768) VAL [\old(cond)=1, isInitial=1, var_1_1=-16, var_1_2=32767, var_1_3=25, var_1_4=-32, var_1_5=1, var_1_6=6599999999999999/10000000000000000, var_1_7=1283/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_1=-16, var_1_2=32767, var_1_3=25, var_1_4=-32, var_1_5=1, var_1_6=6599999999999999/10000000000000000, var_1_7=1283/5] [L42] RET assume_abort_if_not(var_1_2 >= -32768) VAL [isInitial=1, var_1_1=-16, var_1_2=32767, var_1_3=25, var_1_4=-32, var_1_5=1, var_1_6=6599999999999999/10000000000000000, var_1_7=1283/5] [L43] CALL assume_abort_if_not(var_1_2 <= 32767) VAL [\old(cond)=1, isInitial=1, var_1_1=-16, var_1_2=32767, var_1_3=25, var_1_4=-32, var_1_5=1, var_1_6=6599999999999999/10000000000000000, var_1_7=1283/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_1=-16, var_1_2=32767, var_1_3=25, var_1_4=-32, var_1_5=1, var_1_6=6599999999999999/10000000000000000, var_1_7=1283/5] [L43] RET assume_abort_if_not(var_1_2 <= 32767) VAL [isInitial=1, var_1_1=-16, var_1_2=32767, var_1_3=25, var_1_4=-32, var_1_5=1, var_1_6=6599999999999999/10000000000000000, var_1_7=1283/5] [L44] var_1_3 = __VERIFIER_nondet_short() [L45] CALL assume_abort_if_not(var_1_3 >= -32768) VAL [\old(cond)=1, isInitial=1, var_1_1=-16, var_1_2=32767, var_1_3=32766, var_1_4=-32, var_1_5=1, var_1_6=6599999999999999/10000000000000000, var_1_7=1283/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_1=-16, var_1_2=32767, var_1_3=32766, var_1_4=-32, var_1_5=1, var_1_6=6599999999999999/10000000000000000, var_1_7=1283/5] [L45] RET assume_abort_if_not(var_1_3 >= -32768) VAL [isInitial=1, var_1_1=-16, var_1_2=32767, var_1_3=32766, var_1_4=-32, var_1_5=1, var_1_6=6599999999999999/10000000000000000, var_1_7=1283/5] [L46] CALL assume_abort_if_not(var_1_3 <= 32767) VAL [\old(cond)=1, isInitial=1, var_1_1=-16, var_1_2=32767, var_1_3=32766, var_1_4=-32, var_1_5=1, var_1_6=6599999999999999/10000000000000000, var_1_7=1283/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_1=-16, var_1_2=32767, var_1_3=32766, var_1_4=-32, var_1_5=1, var_1_6=6599999999999999/10000000000000000, var_1_7=1283/5] [L46] RET assume_abort_if_not(var_1_3 <= 32767) VAL [isInitial=1, var_1_1=-16, var_1_2=32767, var_1_3=32766, var_1_4=-32, var_1_5=1, var_1_6=6599999999999999/10000000000000000, var_1_7=1283/5] [L47] var_1_4 = __VERIFIER_nondet_long() [L48] CALL assume_abort_if_not(var_1_4 >= -2147483647) VAL [\old(cond)=1, isInitial=1, var_1_1=-16, var_1_2=32767, var_1_3=32766, var_1_4=2147483646, var_1_5=1, var_1_6=6599999999999999/10000000000000000, var_1_7=1283/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_1=-16, var_1_2=32767, var_1_3=32766, var_1_4=2147483646, var_1_5=1, var_1_6=6599999999999999/10000000000000000, var_1_7=1283/5] [L48] RET assume_abort_if_not(var_1_4 >= -2147483647) VAL [isInitial=1, var_1_1=-16, var_1_2=32767, var_1_3=32766, var_1_4=2147483646, var_1_5=1, var_1_6=6599999999999999/10000000000000000, var_1_7=1283/5] [L49] CALL assume_abort_if_not(var_1_4 <= 2147483646) VAL [\old(cond)=1, isInitial=1, var_1_1=-16, var_1_2=32767, var_1_3=32766, var_1_4=2147483646, var_1_5=1, var_1_6=6599999999999999/10000000000000000, var_1_7=1283/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_1=-16, var_1_2=32767, var_1_3=32766, var_1_4=2147483646, var_1_5=1, var_1_6=6599999999999999/10000000000000000, var_1_7=1283/5] [L49] RET assume_abort_if_not(var_1_4 <= 2147483646) VAL [isInitial=1, var_1_1=-16, var_1_2=32767, var_1_3=32766, var_1_4=2147483646, var_1_5=1, var_1_6=6599999999999999/10000000000000000, var_1_7=1283/5] [L50] var_1_7 = __VERIFIER_nondet_float() [L51] CALL assume_abort_if_not((var_1_7 >= -922337.2036854765600e+13F && var_1_7 <= -1.0e-20F) || (var_1_7 <= 9223372.036854765600e+12F && var_1_7 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_1=-16, var_1_2=32767, var_1_3=32766, var_1_4=2147483646, var_1_5=1, var_1_6=6599999999999999/10000000000000000] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_1=-16, var_1_2=32767, var_1_3=32766, var_1_4=2147483646, var_1_5=1, var_1_6=6599999999999999/10000000000000000] [L51] RET assume_abort_if_not((var_1_7 >= -922337.2036854765600e+13F && var_1_7 <= -1.0e-20F) || (var_1_7 <= 9223372.036854765600e+12F && var_1_7 >= 1.0e-20F )) VAL [isInitial=1, var_1_1=-16, var_1_2=32767, var_1_3=32766, var_1_4=2147483646, var_1_5=1, var_1_6=6599999999999999/10000000000000000] [L64] RET updateVariables() [L65] CALL step() [L32] COND FALSE !(var_1_2 <= var_1_3) [L35] var_1_1 = ((((var_1_4) > (((((var_1_3) < (var_1_2)) ? (var_1_3) : (var_1_2))))) ? (var_1_4) : (((((var_1_3) < (var_1_2)) ? (var_1_3) : (var_1_2)))))) VAL [isInitial=1, var_1_1=2147483646, var_1_2=32767, var_1_3=32766, var_1_4=2147483646, var_1_5=1, var_1_6=6599999999999999/10000000000000000] [L37] var_1_5 = 0 [L38] var_1_6 = var_1_7 [L65] RET step() [L66] CALL, EXPR property() [L56-L57] return (((var_1_2 <= var_1_3) ? (var_1_1 == ((signed long int) ((((var_1_2) < ((var_1_3 + -50))) ? (var_1_2) : ((var_1_3 + -50)))))) : (var_1_1 == ((signed long int) ((((var_1_4) > (((((var_1_3) < (var_1_2)) ? (var_1_3) : (var_1_2))))) ? (var_1_4) : (((((var_1_3) < (var_1_2)) ? (var_1_3) : (var_1_2))))))))) && (var_1_5 == ((unsigned char) 0))) && (var_1_6 == ((float) var_1_7)) ; [L66] RET, EXPR property() [L66] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [\old(cond)=0, cond=0, isInitial=1, var_1_1=2147483646, var_1_2=32767, var_1_3=32766, var_1_4=2147483646, var_1_5=0, var_1_6=2147483651, var_1_7=2147483651] [L19] reach_error() VAL [\old(cond)=0, cond=0, isInitial=1, var_1_1=2147483646, var_1_2=32767, var_1_3=32766, var_1_4=2147483646, var_1_5=0, var_1_6=2147483651, var_1_7=2147483651] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 25 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 0.5s, OverallIterations: 2, TraceHistogramMax: 7, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 0 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 0 mSDsluCounter, 27 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3 IncrementalHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 27 mSDtfsCounter, 3 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 23 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=25occurred in iteration=0, InterpolantAutomatonStates: 2, 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, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 90 NumberOfCodeBlocks, 90 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 44 ConstructedInterpolants, 0 QuantifiedInterpolants, 44 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 84/84 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-15 21:06:39,023 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...