/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_variablewrapping_normal_file-96.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-16 04:17:52,545 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-16 04:17:52,607 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 04:17:52,610 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-16 04:17:52,611 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-16 04:17:52,636 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-16 04:17:52,637 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-16 04:17:52,637 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-16 04:17:52,638 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-16 04:17:52,638 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-16 04:17:52,638 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-16 04:17:52,638 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-16 04:17:52,639 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-16 04:17:52,639 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-16 04:17:52,639 INFO L153 SettingsManager]: * Use SBE=true [2023-12-16 04:17:52,639 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-16 04:17:52,640 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-16 04:17:52,640 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-16 04:17:52,640 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-16 04:17:52,640 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-16 04:17:52,640 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-16 04:17:52,641 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-16 04:17:52,641 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-16 04:17:52,641 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-16 04:17:52,641 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-16 04:17:52,641 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-16 04:17:52,642 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-16 04:17:52,642 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-16 04:17:52,642 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-16 04:17:52,642 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-16 04:17:52,642 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-16 04:17:52,643 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-16 04:17:52,643 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-16 04:17:52,643 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-16 04:17:52,643 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-16 04:17:52,643 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-16 04:17:52,643 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-16 04:17:52,643 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-16 04:17:52,644 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-16 04:17:52,644 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-16 04:17:52,644 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-16 04:17:52,644 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-16 04:17:52,644 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-16 04:17:52,644 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 04:17:52,836 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-16 04:17:52,852 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-16 04:17:52,854 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-16 04:17:52,854 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-16 04:17:52,856 INFO L274 PluginConnector]: CDTParser initialized [2023-12-16 04:17:52,857 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/hardness-nfm22/hardness_variablewrapping_normal_file-96.i [2023-12-16 04:17:54,108 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-16 04:17:54,354 INFO L384 CDTParser]: Found 1 translation units. [2023-12-16 04:17:54,355 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_variablewrapping_normal_file-96.i [2023-12-16 04:17:54,363 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e4fdb8531/2055928ab3024f6f8ec2b6abacc02859/FLAGaf0b6dbb1 [2023-12-16 04:17:54,378 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e4fdb8531/2055928ab3024f6f8ec2b6abacc02859 [2023-12-16 04:17:54,385 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-16 04:17:54,386 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-16 04:17:54,387 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-16 04:17:54,387 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-16 04:17:54,395 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-16 04:17:54,395 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 04:17:54" (1/1) ... [2023-12-16 04:17:54,398 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@38974f59 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:17:54, skipping insertion in model container [2023-12-16 04:17:54,398 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 04:17:54" (1/1) ... [2023-12-16 04:17:54,449 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-16 04:17:54,560 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_variablewrapping_normal_file-96.i[913,926] [2023-12-16 04:17:54,595 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-16 04:17:54,618 INFO L202 MainTranslator]: Completed pre-run [2023-12-16 04:17:54,628 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_variablewrapping_normal_file-96.i[913,926] [2023-12-16 04:17:54,649 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-16 04:17:54,660 INFO L206 MainTranslator]: Completed translation [2023-12-16 04:17:54,661 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:17:54 WrapperNode [2023-12-16 04:17:54,661 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-16 04:17:54,662 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-16 04:17:54,662 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-16 04:17:54,662 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-16 04:17:54,667 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:17:54" (1/1) ... [2023-12-16 04:17:54,673 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:17:54" (1/1) ... [2023-12-16 04:17:54,694 INFO L138 Inliner]: procedures = 26, calls = 29, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 111 [2023-12-16 04:17:54,695 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-16 04:17:54,695 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-16 04:17:54,695 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-16 04:17:54,695 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-16 04:17:54,703 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:17:54" (1/1) ... [2023-12-16 04:17:54,703 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:17:54" (1/1) ... [2023-12-16 04:17:54,705 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:17:54" (1/1) ... [2023-12-16 04:17:54,715 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 04:17:54,715 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:17:54" (1/1) ... [2023-12-16 04:17:54,715 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:17:54" (1/1) ... [2023-12-16 04:17:54,720 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:17:54" (1/1) ... [2023-12-16 04:17:54,722 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:17:54" (1/1) ... [2023-12-16 04:17:54,723 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:17:54" (1/1) ... [2023-12-16 04:17:54,724 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:17:54" (1/1) ... [2023-12-16 04:17:54,726 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-16 04:17:54,726 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-16 04:17:54,727 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-16 04:17:54,727 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-16 04:17:54,727 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:17:54" (1/1) ... [2023-12-16 04:17:54,731 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-16 04:17:54,740 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-16 04:17:54,750 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 04:17:54,775 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 04:17:54,790 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-16 04:17:54,790 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-12-16 04:17:54,790 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-12-16 04:17:54,790 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-12-16 04:17:54,790 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-16 04:17:54,790 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-16 04:17:54,841 INFO L241 CfgBuilder]: Building ICFG [2023-12-16 04:17:54,851 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-16 04:17:55,164 INFO L282 CfgBuilder]: Performing block encoding [2023-12-16 04:17:55,242 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-16 04:17:55,242 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-16 04:17:55,242 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 04:17:55 BoogieIcfgContainer [2023-12-16 04:17:55,242 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-16 04:17:55,265 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-16 04:17:55,265 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-16 04:17:55,267 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-16 04:17:55,268 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.12 04:17:54" (1/3) ... [2023-12-16 04:17:55,269 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d278b00 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.12 04:17:55, skipping insertion in model container [2023-12-16 04:17:55,269 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:17:54" (2/3) ... [2023-12-16 04:17:55,269 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d278b00 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.12 04:17:55, skipping insertion in model container [2023-12-16 04:17:55,270 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 04:17:55" (3/3) ... [2023-12-16 04:17:55,271 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_normal_file-96.i [2023-12-16 04:17:55,296 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-16 04:17:55,296 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-16 04:17:55,347 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-16 04:17:55,355 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;@2bed0010, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-16 04:17:55,355 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-16 04:17:55,359 INFO L276 IsEmpty]: Start isEmpty. Operand has 46 states, 27 states have (on average 1.4074074074074074) internal successors, (38), 28 states have internal predecessors, (38), 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 04:17:55,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2023-12-16 04:17:55,386 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:17:55,386 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] [2023-12-16 04:17:55,387 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:17:55,419 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:17:55,419 INFO L85 PathProgramCache]: Analyzing trace with hash -931679415, now seen corresponding path program 1 times [2023-12-16 04:17:55,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:17:55,427 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1878804525] [2023-12-16 04:17:55,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:17:55,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:17:55,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:17:55,778 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-16 04:17:55,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:17:55,792 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-16 04:17:55,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:17:55,799 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-16 04:17:55,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:17:55,807 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-16 04:17:55,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:17:55,814 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-16 04:17:55,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:17:55,823 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-16 04:17:55,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:17:55,829 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-16 04:17:55,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:17:55,834 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-12-16 04:17:55,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:17:55,839 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-16 04:17:55,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:17:55,843 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-12-16 04:17:55,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:17:55,847 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-12-16 04:17:55,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:17:55,855 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-16 04:17:55,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:17:55,858 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-16 04:17:55,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:17:55,862 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-16 04:17:55,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:17:55,869 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-16 04:17:55,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:17:55,873 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2023-12-16 04:17:55,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:17:55,879 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 04:17:55,879 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:17:55,879 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1878804525] [2023-12-16 04:17:55,880 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1878804525] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 04:17:55,880 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 04:17:55,880 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-16 04:17:55,881 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1912305078] [2023-12-16 04:17:55,882 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 04:17:55,885 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-16 04:17:55,886 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:17:55,910 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-16 04:17:55,911 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-16 04:17:55,913 INFO L87 Difference]: Start difference. First operand has 46 states, 27 states have (on average 1.4074074074074074) internal successors, (38), 28 states have internal predecessors, (38), 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 11.0) internal successors, (22), 2 states have internal predecessors, (22), 2 states have call successors, (16), 1 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 04:17:55,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:17:55,957 INFO L93 Difference]: Finished difference Result 89 states and 154 transitions. [2023-12-16 04:17:55,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-16 04:17:55,962 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 11.0) internal successors, (22), 2 states have internal predecessors, (22), 2 states have call successors, (16), 1 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 99 [2023-12-16 04:17:55,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:17:55,968 INFO L225 Difference]: With dead ends: 89 [2023-12-16 04:17:55,968 INFO L226 Difference]: Without dead ends: 44 [2023-12-16 04:17:55,972 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 50 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 04:17:55,975 INFO L413 NwaCegarLoop]: 62 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, 62 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 04:17:55,975 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 62 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 04:17:55,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2023-12-16 04:17:56,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2023-12-16 04:17:56,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 26 states have (on average 1.2692307692307692) internal successors, (33), 26 states have internal predecessors, (33), 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 04:17:56,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 65 transitions. [2023-12-16 04:17:56,017 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 65 transitions. Word has length 99 [2023-12-16 04:17:56,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:17:56,018 INFO L495 AbstractCegarLoop]: Abstraction has 44 states and 65 transitions. [2023-12-16 04:17:56,019 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 11.0) internal successors, (22), 2 states have internal predecessors, (22), 2 states have call successors, (16), 1 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 04:17:56,019 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 65 transitions. [2023-12-16 04:17:56,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2023-12-16 04:17:56,024 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:17:56,024 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] [2023-12-16 04:17:56,024 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-16 04:17:56,024 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:17:56,025 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:17:56,025 INFO L85 PathProgramCache]: Analyzing trace with hash 1870388621, now seen corresponding path program 1 times [2023-12-16 04:17:56,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:17:56,026 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [344208724] [2023-12-16 04:17:56,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:17:56,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:17:56,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:17:56,340 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-16 04:17:56,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:17:56,345 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-16 04:17:56,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:17:56,353 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-16 04:17:56,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:17:56,359 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-16 04:17:56,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:17:56,366 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-16 04:17:56,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:17:56,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-16 04:17:56,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:17:56,378 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-16 04:17:56,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:17:56,383 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-12-16 04:17:56,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:17:56,387 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-16 04:17:56,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:17:56,393 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-12-16 04:17:56,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:17:56,400 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-12-16 04:17:56,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:17:56,407 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-16 04:17:56,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:17:56,411 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-16 04:17:56,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:17:56,424 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-16 04:17:56,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:17:56,428 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-16 04:17:56,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:17:56,434 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2023-12-16 04:17:56,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:17:56,443 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 04:17:56,443 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:17:56,444 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [344208724] [2023-12-16 04:17:56,444 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [344208724] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 04:17:56,444 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 04:17:56,445 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-16 04:17:56,446 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [218898714] [2023-12-16 04:17:56,448 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 04:17:56,451 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-16 04:17:56,453 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:17:56,453 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-16 04:17:56,454 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-16 04:17:56,454 INFO L87 Difference]: Start difference. First operand 44 states and 65 transitions. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 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 04:17:56,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:17:56,574 INFO L93 Difference]: Finished difference Result 139 states and 204 transitions. [2023-12-16 04:17:56,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-16 04:17:56,575 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 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 99 [2023-12-16 04:17:56,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:17:56,577 INFO L225 Difference]: With dead ends: 139 [2023-12-16 04:17:56,578 INFO L226 Difference]: Without dead ends: 96 [2023-12-16 04:17:56,578 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-16 04:17:56,579 INFO L413 NwaCegarLoop]: 59 mSDtfsCounter, 60 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 177 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-16 04:17:56,579 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 177 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-16 04:17:56,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2023-12-16 04:17:56,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 84. [2023-12-16 04:17:56,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 49 states have (on average 1.2448979591836735) internal successors, (61), 49 states have internal predecessors, (61), 32 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2023-12-16 04:17:56,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 125 transitions. [2023-12-16 04:17:56,605 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 125 transitions. Word has length 99 [2023-12-16 04:17:56,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:17:56,607 INFO L495 AbstractCegarLoop]: Abstraction has 84 states and 125 transitions. [2023-12-16 04:17:56,607 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 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 04:17:56,607 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 125 transitions. [2023-12-16 04:17:56,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2023-12-16 04:17:56,613 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:17:56,613 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] [2023-12-16 04:17:56,613 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-16 04:17:56,613 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:17:56,613 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:17:56,613 INFO L85 PathProgramCache]: Analyzing trace with hash 1061041995, now seen corresponding path program 1 times [2023-12-16 04:17:56,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:17:56,614 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [336160198] [2023-12-16 04:17:56,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:17:56,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:17:56,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-16 04:17:56,690 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-16 04:17:56,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-16 04:17:56,767 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-12-16 04:17:56,768 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-12-16 04:17:56,769 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-16 04:17:56,770 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-12-16 04:17:56,772 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2023-12-16 04:17:56,775 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-16 04:17:56,838 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.12 04:17:56 BoogieIcfgContainer [2023-12-16 04:17:56,838 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-16 04:17:56,838 INFO L158 Benchmark]: Toolchain (without parser) took 2451.96ms. Allocated memory is still 276.8MB. Free memory was 225.4MB in the beginning and 167.9MB in the end (delta: 57.5MB). Peak memory consumption was 58.6MB. Max. memory is 8.0GB. [2023-12-16 04:17:56,839 INFO L158 Benchmark]: CDTParser took 0.42ms. Allocated memory is still 164.6MB. Free memory is still 113.5MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-16 04:17:56,839 INFO L158 Benchmark]: CACSL2BoogieTranslator took 273.86ms. Allocated memory is still 276.8MB. Free memory was 225.4MB in the beginning and 212.8MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2023-12-16 04:17:56,839 INFO L158 Benchmark]: Boogie Procedure Inliner took 33.08ms. Allocated memory is still 276.8MB. Free memory was 212.8MB in the beginning and 209.7MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2023-12-16 04:17:56,840 INFO L158 Benchmark]: Boogie Preprocessor took 30.61ms. Allocated memory is still 276.8MB. Free memory was 209.7MB in the beginning and 206.0MB in the end (delta: 3.7MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2023-12-16 04:17:56,840 INFO L158 Benchmark]: RCFGBuilder took 516.11ms. Allocated memory is still 276.8MB. Free memory was 206.0MB in the beginning and 186.6MB in the end (delta: 19.4MB). Peak memory consumption was 19.9MB. Max. memory is 8.0GB. [2023-12-16 04:17:56,840 INFO L158 Benchmark]: TraceAbstraction took 1573.16ms. Allocated memory is still 276.8MB. Free memory was 185.6MB in the beginning and 167.9MB in the end (delta: 17.7MB). Peak memory consumption was 18.7MB. Max. memory is 8.0GB. [2023-12-16 04:17:56,842 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.42ms. Allocated memory is still 164.6MB. Free memory is still 113.5MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 273.86ms. Allocated memory is still 276.8MB. Free memory was 225.4MB in the beginning and 212.8MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 33.08ms. Allocated memory is still 276.8MB. Free memory was 212.8MB in the beginning and 209.7MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 30.61ms. Allocated memory is still 276.8MB. Free memory was 209.7MB in the beginning and 206.0MB in the end (delta: 3.7MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * RCFGBuilder took 516.11ms. Allocated memory is still 276.8MB. Free memory was 206.0MB in the beginning and 186.6MB in the end (delta: 19.4MB). Peak memory consumption was 19.9MB. Max. memory is 8.0GB. * TraceAbstraction took 1573.16ms. Allocated memory is still 276.8MB. Free memory was 185.6MB in the beginning and 167.9MB in the end (delta: 17.7MB). Peak memory consumption was 18.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 someBinaryDOUBLEComparisonOperation at line 98, overapproximation of someBinaryFLOATComparisonOperation at line 98. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned short int var_1_1 = 8; [L23] unsigned char var_1_2 = 0; [L24] unsigned short int var_1_3 = 8; [L25] unsigned short int var_1_4 = 1000; [L26] unsigned char var_1_5 = 1; [L27] unsigned char var_1_6 = 0; [L28] unsigned char var_1_9 = 0; [L29] unsigned char var_1_10 = 0; [L30] double var_1_11 = 4.575; [L31] double var_1_13 = 2.75; [L32] double var_1_14 = 128.5; [L33] signed long int var_1_15 = -1000000000; [L34] float var_1_16 = 99999.25; [L35] signed char var_1_17 = 1; [L36] signed char var_1_18 = 50; [L37] unsigned char last_1_var_1_5 = 1; [L102] isInitial = 1 [L103] FCALL initially() [L104] COND TRUE 1 [L105] CALL updateLastVariables() [L95] last_1_var_1_5 = var_1_5 [L105] RET updateLastVariables() [L106] CALL updateVariables() [L68] var_1_2 = __VERIFIER_nondet_uchar() [L69] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=1, var_1_10=0, var_1_11=183/40, var_1_13=11/4, var_1_14=257/2, var_1_15=-1000000000, var_1_16=399997/4, var_1_17=1, var_1_18=50, var_1_1=8, var_1_3=8, var_1_4=1000, var_1_5=1, var_1_6=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_5=1, var_1_10=0, var_1_11=183/40, var_1_13=11/4, var_1_14=257/2, var_1_15=-1000000000, var_1_16=399997/4, var_1_17=1, var_1_18=50, var_1_1=8, var_1_3=8, var_1_4=1000, var_1_5=1, var_1_6=0, var_1_9=0] [L69] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, last_1_var_1_5=1, var_1_10=0, var_1_11=183/40, var_1_13=11/4, var_1_14=257/2, var_1_15=-1000000000, var_1_16=399997/4, var_1_17=1, var_1_18=50, var_1_1=8, var_1_3=8, var_1_4=1000, var_1_5=1, var_1_6=0, var_1_9=0] [L70] CALL assume_abort_if_not(var_1_2 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=1, var_1_10=0, var_1_11=183/40, var_1_13=11/4, var_1_14=257/2, var_1_15=-1000000000, var_1_16=399997/4, var_1_17=1, var_1_18=50, var_1_1=8, var_1_2=0, var_1_3=8, var_1_4=1000, var_1_5=1, var_1_6=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_5=1, var_1_10=0, var_1_11=183/40, var_1_13=11/4, var_1_14=257/2, var_1_15=-1000000000, var_1_16=399997/4, var_1_17=1, var_1_18=50, var_1_1=8, var_1_2=0, var_1_3=8, var_1_4=1000, var_1_5=1, var_1_6=0, var_1_9=0] [L70] RET assume_abort_if_not(var_1_2 <= 1) VAL [isInitial=1, last_1_var_1_5=1, var_1_10=0, var_1_11=183/40, var_1_13=11/4, var_1_14=257/2, var_1_15=-1000000000, var_1_16=399997/4, var_1_17=1, var_1_18=50, var_1_1=8, var_1_2=0, var_1_3=8, var_1_4=1000, var_1_5=1, var_1_6=0, var_1_9=0] [L71] var_1_3 = __VERIFIER_nondet_ushort() [L72] CALL assume_abort_if_not(var_1_3 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=1, var_1_10=0, var_1_11=183/40, var_1_13=11/4, var_1_14=257/2, var_1_15=-1000000000, var_1_16=399997/4, var_1_17=1, var_1_18=50, var_1_1=8, var_1_2=0, var_1_4=1000, var_1_5=1, var_1_6=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_5=1, var_1_10=0, var_1_11=183/40, var_1_13=11/4, var_1_14=257/2, var_1_15=-1000000000, var_1_16=399997/4, var_1_17=1, var_1_18=50, var_1_1=8, var_1_2=0, var_1_4=1000, var_1_5=1, var_1_6=0, var_1_9=0] [L72] RET assume_abort_if_not(var_1_3 >= 0) VAL [isInitial=1, last_1_var_1_5=1, var_1_10=0, var_1_11=183/40, var_1_13=11/4, var_1_14=257/2, var_1_15=-1000000000, var_1_16=399997/4, var_1_17=1, var_1_18=50, var_1_1=8, var_1_2=0, var_1_4=1000, var_1_5=1, var_1_6=0, var_1_9=0] [L73] CALL assume_abort_if_not(var_1_3 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=1, var_1_10=0, var_1_11=183/40, var_1_13=11/4, var_1_14=257/2, var_1_15=-1000000000, var_1_16=399997/4, var_1_17=1, var_1_18=50, var_1_1=8, var_1_2=0, var_1_3=16, var_1_4=1000, var_1_5=1, var_1_6=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_5=1, var_1_10=0, var_1_11=183/40, var_1_13=11/4, var_1_14=257/2, var_1_15=-1000000000, var_1_16=399997/4, var_1_17=1, var_1_18=50, var_1_1=8, var_1_2=0, var_1_3=16, var_1_4=1000, var_1_5=1, var_1_6=0, var_1_9=0] [L73] RET assume_abort_if_not(var_1_3 <= 65534) VAL [isInitial=1, last_1_var_1_5=1, var_1_10=0, var_1_11=183/40, var_1_13=11/4, var_1_14=257/2, var_1_15=-1000000000, var_1_16=399997/4, var_1_17=1, var_1_18=50, var_1_1=8, var_1_2=0, var_1_3=16, var_1_4=1000, var_1_5=1, var_1_6=0, var_1_9=0] [L74] var_1_4 = __VERIFIER_nondet_ushort() [L75] CALL assume_abort_if_not(var_1_4 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=1, var_1_10=0, var_1_11=183/40, var_1_13=11/4, var_1_14=257/2, var_1_15=-1000000000, var_1_16=399997/4, var_1_17=1, var_1_18=50, var_1_1=8, var_1_2=0, var_1_3=16, var_1_5=1, var_1_6=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_5=1, var_1_10=0, var_1_11=183/40, var_1_13=11/4, var_1_14=257/2, var_1_15=-1000000000, var_1_16=399997/4, var_1_17=1, var_1_18=50, var_1_1=8, var_1_2=0, var_1_3=16, var_1_5=1, var_1_6=0, var_1_9=0] [L75] RET assume_abort_if_not(var_1_4 >= 0) VAL [isInitial=1, last_1_var_1_5=1, var_1_10=0, var_1_11=183/40, var_1_13=11/4, var_1_14=257/2, var_1_15=-1000000000, var_1_16=399997/4, var_1_17=1, var_1_18=50, var_1_1=8, var_1_2=0, var_1_3=16, var_1_5=1, var_1_6=0, var_1_9=0] [L76] CALL assume_abort_if_not(var_1_4 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=1, var_1_10=0, var_1_11=183/40, var_1_13=11/4, var_1_14=257/2, var_1_15=-1000000000, var_1_16=399997/4, var_1_17=1, var_1_18=50, var_1_1=8, var_1_2=0, var_1_3=16, var_1_4=16, var_1_5=1, var_1_6=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_5=1, var_1_10=0, var_1_11=183/40, var_1_13=11/4, var_1_14=257/2, var_1_15=-1000000000, var_1_16=399997/4, var_1_17=1, var_1_18=50, var_1_1=8, var_1_2=0, var_1_3=16, var_1_4=16, var_1_5=1, var_1_6=0, var_1_9=0] [L76] RET assume_abort_if_not(var_1_4 <= 65534) VAL [isInitial=1, last_1_var_1_5=1, var_1_10=0, var_1_11=183/40, var_1_13=11/4, var_1_14=257/2, var_1_15=-1000000000, var_1_16=399997/4, var_1_17=1, var_1_18=50, var_1_1=8, var_1_2=0, var_1_3=16, var_1_4=16, var_1_5=1, var_1_6=0, var_1_9=0] [L77] var_1_6 = __VERIFIER_nondet_uchar() [L78] CALL assume_abort_if_not(var_1_6 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=1, var_1_10=0, var_1_11=183/40, var_1_13=11/4, var_1_14=257/2, var_1_15=-1000000000, var_1_16=399997/4, var_1_17=1, var_1_18=50, var_1_1=8, var_1_2=0, var_1_3=16, var_1_4=16, var_1_5=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_5=1, var_1_10=0, var_1_11=183/40, var_1_13=11/4, var_1_14=257/2, var_1_15=-1000000000, var_1_16=399997/4, var_1_17=1, var_1_18=50, var_1_1=8, var_1_2=0, var_1_3=16, var_1_4=16, var_1_5=1, var_1_9=0] [L78] RET assume_abort_if_not(var_1_6 >= 0) VAL [isInitial=1, last_1_var_1_5=1, var_1_10=0, var_1_11=183/40, var_1_13=11/4, var_1_14=257/2, var_1_15=-1000000000, var_1_16=399997/4, var_1_17=1, var_1_18=50, var_1_1=8, var_1_2=0, var_1_3=16, var_1_4=16, var_1_5=1, var_1_9=0] [L79] CALL assume_abort_if_not(var_1_6 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=1, var_1_10=0, var_1_11=183/40, var_1_13=11/4, var_1_14=257/2, var_1_15=-1000000000, var_1_16=399997/4, var_1_17=1, var_1_18=50, var_1_1=8, var_1_2=0, var_1_3=16, var_1_4=16, var_1_5=1, var_1_6=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_5=1, var_1_10=0, var_1_11=183/40, var_1_13=11/4, var_1_14=257/2, var_1_15=-1000000000, var_1_16=399997/4, var_1_17=1, var_1_18=50, var_1_1=8, var_1_2=0, var_1_3=16, var_1_4=16, var_1_5=1, var_1_6=1, var_1_9=0] [L79] RET assume_abort_if_not(var_1_6 <= 1) VAL [isInitial=1, last_1_var_1_5=1, var_1_10=0, var_1_11=183/40, var_1_13=11/4, var_1_14=257/2, var_1_15=-1000000000, var_1_16=399997/4, var_1_17=1, var_1_18=50, var_1_1=8, var_1_2=0, var_1_3=16, var_1_4=16, var_1_5=1, var_1_6=1, var_1_9=0] [L80] var_1_9 = __VERIFIER_nondet_uchar() [L81] CALL assume_abort_if_not(var_1_9 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=1, var_1_10=0, var_1_11=183/40, var_1_13=11/4, var_1_14=257/2, var_1_15=-1000000000, var_1_16=399997/4, var_1_17=1, var_1_18=50, var_1_1=8, var_1_2=0, var_1_3=16, var_1_4=16, var_1_5=1, var_1_6=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_5=1, var_1_10=0, var_1_11=183/40, var_1_13=11/4, var_1_14=257/2, var_1_15=-1000000000, var_1_16=399997/4, var_1_17=1, var_1_18=50, var_1_1=8, var_1_2=0, var_1_3=16, var_1_4=16, var_1_5=1, var_1_6=1] [L81] RET assume_abort_if_not(var_1_9 >= 0) VAL [isInitial=1, last_1_var_1_5=1, var_1_10=0, var_1_11=183/40, var_1_13=11/4, var_1_14=257/2, var_1_15=-1000000000, var_1_16=399997/4, var_1_17=1, var_1_18=50, var_1_1=8, var_1_2=0, var_1_3=16, var_1_4=16, var_1_5=1, var_1_6=1] [L82] CALL assume_abort_if_not(var_1_9 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=1, var_1_10=0, var_1_11=183/40, var_1_13=11/4, var_1_14=257/2, var_1_15=-1000000000, var_1_16=399997/4, var_1_17=1, var_1_18=50, var_1_1=8, var_1_2=0, var_1_3=16, var_1_4=16, var_1_5=1, var_1_6=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_5=1, var_1_10=0, var_1_11=183/40, var_1_13=11/4, var_1_14=257/2, var_1_15=-1000000000, var_1_16=399997/4, var_1_17=1, var_1_18=50, var_1_1=8, var_1_2=0, var_1_3=16, var_1_4=16, var_1_5=1, var_1_6=1, var_1_9=0] [L82] RET assume_abort_if_not(var_1_9 <= 0) VAL [isInitial=1, last_1_var_1_5=1, var_1_10=0, var_1_11=183/40, var_1_13=11/4, var_1_14=257/2, var_1_15=-1000000000, var_1_16=399997/4, var_1_17=1, var_1_18=50, var_1_1=8, var_1_2=0, var_1_3=16, var_1_4=16, var_1_5=1, var_1_6=1, var_1_9=0] [L83] var_1_10 = __VERIFIER_nondet_uchar() [L84] CALL assume_abort_if_not(var_1_10 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=1, var_1_10=1, var_1_11=183/40, var_1_13=11/4, var_1_14=257/2, var_1_15=-1000000000, var_1_16=399997/4, var_1_17=1, var_1_18=50, var_1_1=8, var_1_2=0, var_1_3=16, var_1_4=16, var_1_5=1, var_1_6=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_5=1, var_1_10=1, var_1_11=183/40, var_1_13=11/4, var_1_14=257/2, var_1_15=-1000000000, var_1_16=399997/4, var_1_17=1, var_1_18=50, var_1_1=8, var_1_2=0, var_1_3=16, var_1_4=16, var_1_5=1, var_1_6=1, var_1_9=0] [L84] RET assume_abort_if_not(var_1_10 >= 1) VAL [isInitial=1, last_1_var_1_5=1, var_1_10=1, var_1_11=183/40, var_1_13=11/4, var_1_14=257/2, var_1_15=-1000000000, var_1_16=399997/4, var_1_17=1, var_1_18=50, var_1_1=8, var_1_2=0, var_1_3=16, var_1_4=16, var_1_5=1, var_1_6=1, var_1_9=0] [L85] CALL assume_abort_if_not(var_1_10 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=1, var_1_10=1, var_1_11=183/40, var_1_13=11/4, var_1_14=257/2, var_1_15=-1000000000, var_1_16=399997/4, var_1_17=1, var_1_18=50, var_1_1=8, var_1_2=0, var_1_3=16, var_1_4=16, var_1_5=1, var_1_6=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_5=1, var_1_10=1, var_1_11=183/40, var_1_13=11/4, var_1_14=257/2, var_1_15=-1000000000, var_1_16=399997/4, var_1_17=1, var_1_18=50, var_1_1=8, var_1_2=0, var_1_3=16, var_1_4=16, var_1_5=1, var_1_6=1, var_1_9=0] [L85] RET assume_abort_if_not(var_1_10 <= 1) VAL [isInitial=1, last_1_var_1_5=1, var_1_10=1, var_1_11=183/40, var_1_13=11/4, var_1_14=257/2, var_1_15=-1000000000, var_1_16=399997/4, var_1_17=1, var_1_18=50, var_1_1=8, var_1_2=0, var_1_3=16, var_1_4=16, var_1_5=1, var_1_6=1, var_1_9=0] [L86] var_1_13 = __VERIFIER_nondet_double() [L87] CALL assume_abort_if_not((var_1_13 >= -461168.6018427382800e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 4611686.018427382800e+12F && var_1_13 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=1, var_1_10=1, var_1_11=183/40, var_1_14=257/2, var_1_15=-1000000000, var_1_16=399997/4, var_1_17=1, var_1_18=50, var_1_1=8, var_1_2=0, var_1_3=16, var_1_4=16, var_1_5=1, var_1_6=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_5=1, var_1_10=1, var_1_11=183/40, var_1_14=257/2, var_1_15=-1000000000, var_1_16=399997/4, var_1_17=1, var_1_18=50, var_1_1=8, var_1_2=0, var_1_3=16, var_1_4=16, var_1_5=1, var_1_6=1, var_1_9=0] [L87] RET assume_abort_if_not((var_1_13 >= -461168.6018427382800e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 4611686.018427382800e+12F && var_1_13 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_5=1, var_1_10=1, var_1_11=183/40, var_1_14=257/2, var_1_15=-1000000000, var_1_16=399997/4, var_1_17=1, var_1_18=50, var_1_1=8, var_1_2=0, var_1_3=16, var_1_4=16, var_1_5=1, var_1_6=1, var_1_9=0] [L88] var_1_14 = __VERIFIER_nondet_double() [L89] CALL assume_abort_if_not((var_1_14 >= -461168.6018427382800e+13F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 4611686.018427382800e+12F && var_1_14 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=1, var_1_10=1, var_1_11=183/40, var_1_15=-1000000000, var_1_16=399997/4, var_1_17=1, var_1_18=50, var_1_1=8, var_1_2=0, var_1_3=16, var_1_4=16, var_1_5=1, var_1_6=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_5=1, var_1_10=1, var_1_11=183/40, var_1_15=-1000000000, var_1_16=399997/4, var_1_17=1, var_1_18=50, var_1_1=8, var_1_2=0, var_1_3=16, var_1_4=16, var_1_5=1, var_1_6=1, var_1_9=0] [L89] RET assume_abort_if_not((var_1_14 >= -461168.6018427382800e+13F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 4611686.018427382800e+12F && var_1_14 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_5=1, var_1_10=1, var_1_11=183/40, var_1_15=-1000000000, var_1_16=399997/4, var_1_17=1, var_1_18=50, var_1_1=8, var_1_2=0, var_1_3=16, var_1_4=16, var_1_5=1, var_1_6=1, var_1_9=0] [L90] var_1_18 = __VERIFIER_nondet_char() [L91] CALL assume_abort_if_not(var_1_18 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=1, var_1_10=1, var_1_11=183/40, var_1_15=-1000000000, var_1_16=399997/4, var_1_17=1, var_1_18=126, var_1_1=8, var_1_2=0, var_1_3=16, var_1_4=16, var_1_5=1, var_1_6=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_5=1, var_1_10=1, var_1_11=183/40, var_1_15=-1000000000, var_1_16=399997/4, var_1_17=1, var_1_18=126, var_1_1=8, var_1_2=0, var_1_3=16, var_1_4=16, var_1_5=1, var_1_6=1, var_1_9=0] [L91] RET assume_abort_if_not(var_1_18 >= -127) VAL [isInitial=1, last_1_var_1_5=1, var_1_10=1, var_1_11=183/40, var_1_15=-1000000000, var_1_16=399997/4, var_1_17=1, var_1_18=126, var_1_1=8, var_1_2=0, var_1_3=16, var_1_4=16, var_1_5=1, var_1_6=1, var_1_9=0] [L92] CALL assume_abort_if_not(var_1_18 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=1, var_1_10=1, var_1_11=183/40, var_1_15=-1000000000, var_1_16=399997/4, var_1_17=1, var_1_18=126, var_1_1=8, var_1_2=0, var_1_3=16, var_1_4=16, var_1_5=1, var_1_6=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_5=1, var_1_10=1, var_1_11=183/40, var_1_15=-1000000000, var_1_16=399997/4, var_1_17=1, var_1_18=126, var_1_1=8, var_1_2=0, var_1_3=16, var_1_4=16, var_1_5=1, var_1_6=1, var_1_9=0] [L92] RET assume_abort_if_not(var_1_18 <= 126) VAL [isInitial=1, last_1_var_1_5=1, var_1_10=1, var_1_11=183/40, var_1_15=-1000000000, var_1_16=399997/4, var_1_17=1, var_1_18=126, var_1_1=8, var_1_2=0, var_1_3=16, var_1_4=16, var_1_5=1, var_1_6=1, var_1_9=0] [L106] RET updateVariables() [L107] CALL step() [L41] COND FALSE !(! last_1_var_1_5) [L44] var_1_1 = var_1_4 VAL [isInitial=1, last_1_var_1_5=1, var_1_10=1, var_1_11=183/40, var_1_15=-1000000000, var_1_16=399997/4, var_1_17=1, var_1_18=126, var_1_1=16, var_1_2=0, var_1_3=16, var_1_4=16, var_1_5=1, var_1_6=1, var_1_9=0] [L46] unsigned char stepLocal_0 = var_1_6; VAL [isInitial=1, last_1_var_1_5=1, stepLocal_0=1, var_1_10=1, var_1_11=183/40, var_1_15=-1000000000, var_1_16=399997/4, var_1_17=1, var_1_18=126, var_1_1=16, var_1_2=0, var_1_3=16, var_1_4=16, var_1_5=1, var_1_6=1, var_1_9=0] [L47] COND FALSE !(\read(var_1_2)) VAL [isInitial=1, last_1_var_1_5=1, stepLocal_0=1, var_1_10=1, var_1_11=183/40, var_1_15=-1000000000, var_1_16=399997/4, var_1_17=1, var_1_18=126, var_1_1=16, var_1_2=0, var_1_3=16, var_1_4=16, var_1_5=1, var_1_6=1, var_1_9=0] [L56] var_1_15 = var_1_1 [L57] var_1_16 = var_1_13 [L58] var_1_17 = var_1_18 VAL [isInitial=1, last_1_var_1_5=1, stepLocal_0=1, var_1_10=1, var_1_11=183/40, var_1_13=100004, var_1_15=16, var_1_16=100004, var_1_17=126, var_1_18=126, var_1_1=16, var_1_2=0, var_1_3=16, var_1_4=16, var_1_5=1, var_1_6=1, var_1_9=0] [L59] COND FALSE !(((((var_1_15) < 0 ) ? -(var_1_15) : (var_1_15))) > var_1_15) VAL [isInitial=1, last_1_var_1_5=1, stepLocal_0=1, var_1_10=1, var_1_11=183/40, var_1_13=100004, var_1_15=16, var_1_16=100004, var_1_17=126, var_1_18=126, var_1_1=16, var_1_2=0, var_1_3=16, var_1_4=16, var_1_5=1, var_1_6=1, var_1_9=0] [L107] RET step() [L108] CALL, EXPR property() [L98-L99] return ((((((! last_1_var_1_5) ? (var_1_1 == ((unsigned short int) ((((var_1_3) < (var_1_4)) ? (var_1_3) : (var_1_4))))) : (var_1_1 == ((unsigned short int) var_1_4))) && (var_1_2 ? ((var_1_6 && ((var_1_3 >= 16) || last_1_var_1_5)) ? (var_1_6 ? (var_1_5 == ((unsigned char) ((var_1_1 < var_1_1) && var_1_9))) : (var_1_5 == ((unsigned char) var_1_10))) : 1) : 1)) && ((((((var_1_15) < 0 ) ? -(var_1_15) : (var_1_15))) > var_1_15) ? (((var_1_15 / -5) >= ((var_1_4 + var_1_15) - ((((var_1_1) < (var_1_3)) ? (var_1_1) : (var_1_3))))) ? (var_1_11 == ((double) (var_1_13 + var_1_14))) : (var_1_11 == ((double) var_1_14))) : 1)) && (var_1_15 == ((signed long int) var_1_1))) && (var_1_16 == ((float) var_1_13))) && (var_1_17 == ((signed char) var_1_18)) ; [L108] RET, EXPR property() [L108] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [\old(cond)=0, cond=0, isInitial=1, last_1_var_1_5=1, var_1_10=1, var_1_11=183/40, var_1_13=100004, var_1_15=16, var_1_16=100004, var_1_17=126, var_1_18=126, var_1_1=16, var_1_2=0, var_1_3=16, var_1_4=16, var_1_5=1, var_1_6=1, var_1_9=0] [L19] reach_error() VAL [\old(cond)=0, cond=0, isInitial=1, last_1_var_1_5=1, var_1_10=1, var_1_11=183/40, var_1_13=100004, var_1_15=16, var_1_16=100004, var_1_17=126, var_1_18=126, var_1_1=16, var_1_2=0, var_1_3=16, var_1_4=16, var_1_5=1, var_1_6=1, var_1_9=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 46 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.4s, OverallIterations: 3, TraceHistogramMax: 16, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 60 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 60 mSDsluCounter, 239 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 118 mSDsCounter, 49 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 19 IncrementalHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 49 mSolverCounterUnsat, 121 mSDtfsCounter, 19 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 88 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=84occurred in iteration=2, InterpolantAutomatonStates: 6, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 2 MinimizatonAttempts, 12 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 297 NumberOfCodeBlocks, 297 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 196 ConstructedInterpolants, 0 QuantifiedInterpolants, 250 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 PerfectInterpolantSequences, 960/960 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 04:17:56,877 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...