/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_floatingpointinfluence_no-floats_file-25.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-16 03:33:55,890 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-16 03:33:55,971 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 03:33:55,975 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-16 03:33:55,975 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-16 03:33:55,997 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-16 03:33:55,998 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-16 03:33:55,998 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-16 03:33:55,998 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-16 03:33:56,001 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-16 03:33:56,002 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-16 03:33:56,002 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-16 03:33:56,002 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-16 03:33:56,003 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-16 03:33:56,003 INFO L153 SettingsManager]: * Use SBE=true [2023-12-16 03:33:56,004 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-16 03:33:56,004 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-16 03:33:56,004 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-16 03:33:56,004 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-16 03:33:56,004 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-16 03:33:56,004 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-16 03:33:56,005 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-16 03:33:56,005 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-16 03:33:56,005 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-16 03:33:56,005 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-16 03:33:56,005 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-16 03:33:56,005 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-16 03:33:56,006 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-16 03:33:56,006 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-16 03:33:56,006 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-16 03:33:56,007 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-16 03:33:56,007 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-16 03:33:56,007 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-16 03:33:56,007 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-16 03:33:56,007 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-16 03:33:56,008 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-16 03:33:56,008 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-16 03:33:56,008 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-16 03:33:56,008 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-16 03:33:56,008 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-16 03:33:56,008 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-16 03:33:56,008 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-16 03:33:56,009 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-16 03:33:56,009 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 03:33:56,196 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-16 03:33:56,237 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-16 03:33:56,239 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-16 03:33:56,239 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-16 03:33:56,240 INFO L274 PluginConnector]: CDTParser initialized [2023-12-16 03:33:56,241 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-25.i [2023-12-16 03:33:57,292 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-16 03:33:57,462 INFO L384 CDTParser]: Found 1 translation units. [2023-12-16 03:33:57,463 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-25.i [2023-12-16 03:33:57,470 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3d630e1b6/624dbc299c8848ed87d3a6734477e802/FLAGcb078f4ce [2023-12-16 03:33:57,486 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3d630e1b6/624dbc299c8848ed87d3a6734477e802 [2023-12-16 03:33:57,487 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-16 03:33:57,488 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-16 03:33:57,491 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-16 03:33:57,491 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-16 03:33:57,494 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-16 03:33:57,495 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 03:33:57" (1/1) ... [2023-12-16 03:33:57,495 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@72e25712 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 03:33:57, skipping insertion in model container [2023-12-16 03:33:57,495 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 03:33:57" (1/1) ... [2023-12-16 03:33:57,522 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-16 03:33:57,638 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_floatingpointinfluence_no-floats_file-25.i[916,929] [2023-12-16 03:33:57,684 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-16 03:33:57,700 INFO L202 MainTranslator]: Completed pre-run [2023-12-16 03:33:57,712 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_floatingpointinfluence_no-floats_file-25.i[916,929] [2023-12-16 03:33:57,736 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-16 03:33:57,755 INFO L206 MainTranslator]: Completed translation [2023-12-16 03:33:57,755 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 03:33:57 WrapperNode [2023-12-16 03:33:57,755 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-16 03:33:57,757 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-16 03:33:57,757 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-16 03:33:57,757 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-16 03:33:57,761 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 03:33:57" (1/1) ... [2023-12-16 03:33:57,777 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 03:33:57" (1/1) ... [2023-12-16 03:33:57,805 INFO L138 Inliner]: procedures = 26, calls = 33, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 118 [2023-12-16 03:33:57,805 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-16 03:33:57,806 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-16 03:33:57,806 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-16 03:33:57,806 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-16 03:33:57,814 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 03:33:57" (1/1) ... [2023-12-16 03:33:57,814 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 03:33:57" (1/1) ... [2023-12-16 03:33:57,816 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 03:33:57" (1/1) ... [2023-12-16 03:33:57,827 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 03:33:57,827 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 03:33:57" (1/1) ... [2023-12-16 03:33:57,827 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 03:33:57" (1/1) ... [2023-12-16 03:33:57,836 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 03:33:57" (1/1) ... [2023-12-16 03:33:57,838 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 03:33:57" (1/1) ... [2023-12-16 03:33:57,839 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 03:33:57" (1/1) ... [2023-12-16 03:33:57,840 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 03:33:57" (1/1) ... [2023-12-16 03:33:57,842 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-16 03:33:57,842 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-16 03:33:57,842 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-16 03:33:57,843 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-16 03:33:57,843 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 03:33:57" (1/1) ... [2023-12-16 03:33:57,872 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-16 03:33:57,882 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-16 03:33:57,917 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 03:33:57,959 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 03:33:57,974 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-16 03:33:57,974 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-12-16 03:33:57,974 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-12-16 03:33:57,974 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-12-16 03:33:57,974 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-16 03:33:57,974 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-16 03:33:58,046 INFO L241 CfgBuilder]: Building ICFG [2023-12-16 03:33:58,049 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-16 03:33:58,289 INFO L282 CfgBuilder]: Performing block encoding [2023-12-16 03:33:58,322 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-16 03:33:58,322 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-16 03:33:58,323 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 03:33:58 BoogieIcfgContainer [2023-12-16 03:33:58,323 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-16 03:33:58,324 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-16 03:33:58,324 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-16 03:33:58,327 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-16 03:33:58,327 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.12 03:33:57" (1/3) ... [2023-12-16 03:33:58,327 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@27e1658a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.12 03:33:58, skipping insertion in model container [2023-12-16 03:33:58,327 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 03:33:57" (2/3) ... [2023-12-16 03:33:58,327 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@27e1658a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.12 03:33:58, skipping insertion in model container [2023-12-16 03:33:58,327 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 03:33:58" (3/3) ... [2023-12-16 03:33:58,328 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_no-floats_file-25.i [2023-12-16 03:33:58,340 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-16 03:33:58,341 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-16 03:33:58,377 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-16 03:33:58,382 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;@233ceb23, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-16 03:33:58,384 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-16 03:33:58,393 INFO L276 IsEmpty]: Start isEmpty. Operand has 52 states, 29 states have (on average 1.4137931034482758) internal successors, (41), 30 states have internal predecessors, (41), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2023-12-16 03:33:58,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2023-12-16 03:33:58,408 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 03:33:58,408 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 03:33:58,409 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 03:33:58,414 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 03:33:58,414 INFO L85 PathProgramCache]: Analyzing trace with hash 437782606, now seen corresponding path program 1 times [2023-12-16 03:33:58,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 03:33:58,421 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [733906572] [2023-12-16 03:33:58,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 03:33:58,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 03:33:58,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:33:58,626 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-16 03:33:58,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:33:58,631 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-16 03:33:58,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:33:58,642 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-16 03:33:58,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:33:58,646 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-16 03:33:58,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:33:58,649 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-16 03:33:58,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:33:58,651 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-16 03:33:58,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:33:58,654 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-16 03:33:58,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:33:58,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-12-16 03:33:58,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:33:58,662 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-16 03:33:58,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:33:58,665 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-12-16 03:33:58,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:33:58,669 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-12-16 03:33:58,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:33:58,672 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-16 03:33:58,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:33:58,675 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-16 03:33:58,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:33:58,679 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-12-16 03:33:58,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:33:58,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-12-16 03:33:58,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:33:58,684 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-12-16 03:33:58,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:33:58,687 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-12-16 03:33:58,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:33:58,690 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-12-16 03:33:58,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:33:58,698 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-12-16 03:33:58,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:33:58,701 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2023-12-16 03:33:58,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:33:58,717 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2023-12-16 03:33:58,718 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 03:33:58,718 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [733906572] [2023-12-16 03:33:58,719 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [733906572] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 03:33:58,719 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 03:33:58,719 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-16 03:33:58,720 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [878891300] [2023-12-16 03:33:58,721 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 03:33:58,724 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-16 03:33:58,724 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 03:33:58,764 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-16 03:33:58,764 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-16 03:33:58,767 INFO L87 Difference]: Start difference. First operand has 52 states, 29 states have (on average 1.4137931034482758) internal successors, (41), 30 states have internal predecessors, (41), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) Second operand has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2023-12-16 03:33:58,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 03:33:58,808 INFO L93 Difference]: Finished difference Result 101 states and 180 transitions. [2023-12-16 03:33:58,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-16 03:33:58,811 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) Word has length 121 [2023-12-16 03:33:58,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 03:33:58,818 INFO L225 Difference]: With dead ends: 101 [2023-12-16 03:33:58,818 INFO L226 Difference]: Without dead ends: 50 [2023-12-16 03:33:58,821 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 62 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 03:33:58,824 INFO L413 NwaCegarLoop]: 73 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, 73 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 03:33:58,825 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 73 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 03:33:58,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2023-12-16 03:33:58,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2023-12-16 03:33:58,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 28 states have (on average 1.2857142857142858) internal successors, (36), 28 states have internal predecessors, (36), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2023-12-16 03:33:58,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 76 transitions. [2023-12-16 03:33:58,853 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 76 transitions. Word has length 121 [2023-12-16 03:33:58,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 03:33:58,854 INFO L495 AbstractCegarLoop]: Abstraction has 50 states and 76 transitions. [2023-12-16 03:33:58,854 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2023-12-16 03:33:58,854 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 76 transitions. [2023-12-16 03:33:58,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2023-12-16 03:33:58,856 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 03:33:58,856 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 03:33:58,856 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-16 03:33:58,857 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 03:33:58,864 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 03:33:58,864 INFO L85 PathProgramCache]: Analyzing trace with hash 479436878, now seen corresponding path program 1 times [2023-12-16 03:33:58,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 03:33:58,865 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [628371214] [2023-12-16 03:33:58,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 03:33:58,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 03:33:58,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:33:59,258 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-16 03:33:59,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:33:59,266 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-16 03:33:59,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:33:59,273 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-16 03:33:59,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:33:59,276 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-16 03:33:59,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:33:59,280 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-16 03:33:59,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:33:59,283 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-16 03:33:59,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:33:59,288 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-16 03:33:59,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:33:59,305 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-12-16 03:33:59,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:33:59,308 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-16 03:33:59,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:33:59,310 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-12-16 03:33:59,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:33:59,312 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-12-16 03:33:59,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:33:59,314 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-16 03:33:59,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:33:59,317 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-16 03:33:59,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:33:59,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-12-16 03:33:59,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:33:59,320 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-12-16 03:33:59,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:33:59,322 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-12-16 03:33:59,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:33:59,323 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-12-16 03:33:59,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:33:59,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-12-16 03:33:59,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:33:59,327 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-12-16 03:33:59,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:33:59,373 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2023-12-16 03:33:59,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:33:59,387 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 54 proven. 3 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2023-12-16 03:33:59,387 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 03:33:59,387 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [628371214] [2023-12-16 03:33:59,388 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [628371214] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-16 03:33:59,388 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1191820464] [2023-12-16 03:33:59,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 03:33:59,388 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-16 03:33:59,388 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-16 03:33:59,391 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-16 03:33:59,394 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-12-16 03:33:59,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:33:59,489 INFO L262 TraceCheckSpWp]: Trace formula consists of 273 conjuncts, 8 conjunts are in the unsatisfiable core [2023-12-16 03:33:59,495 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 03:33:59,589 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 127 proven. 3 refuted. 0 times theorem prover too weak. 630 trivial. 0 not checked. [2023-12-16 03:33:59,589 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 03:33:59,763 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 54 proven. 3 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2023-12-16 03:33:59,765 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1191820464] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-16 03:33:59,765 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-16 03:33:59,766 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 9 [2023-12-16 03:33:59,766 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1637957039] [2023-12-16 03:33:59,766 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-16 03:33:59,769 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-16 03:33:59,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 03:33:59,770 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-16 03:33:59,770 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2023-12-16 03:33:59,770 INFO L87 Difference]: Start difference. First operand 50 states and 76 transitions. Second operand has 9 states, 9 states have (on average 4.0) internal successors, (36), 9 states have internal predecessors, (36), 2 states have call successors, (21), 2 states have call predecessors, (21), 4 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2023-12-16 03:34:00,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 03:34:00,108 INFO L93 Difference]: Finished difference Result 151 states and 224 transitions. [2023-12-16 03:34:00,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-12-16 03:34:00,109 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.0) internal successors, (36), 9 states have internal predecessors, (36), 2 states have call successors, (21), 2 states have call predecessors, (21), 4 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) Word has length 121 [2023-12-16 03:34:00,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 03:34:00,110 INFO L225 Difference]: With dead ends: 151 [2023-12-16 03:34:00,110 INFO L226 Difference]: Without dead ends: 102 [2023-12-16 03:34:00,111 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 298 GetRequests, 278 SyntacticMatches, 3 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=120, Invalid=222, Unknown=0, NotChecked=0, Total=342 [2023-12-16 03:34:00,112 INFO L413 NwaCegarLoop]: 46 mSDtfsCounter, 176 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 167 mSolverCounterSat, 239 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 177 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 406 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 239 IncrementalHoareTripleChecker+Valid, 167 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-16 03:34:00,112 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [177 Valid, 124 Invalid, 406 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [239 Valid, 167 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-16 03:34:00,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2023-12-16 03:34:00,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 95. [2023-12-16 03:34:00,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 53 states have (on average 1.2264150943396226) internal successors, (65), 54 states have internal predecessors, (65), 38 states have call successors, (38), 3 states have call predecessors, (38), 3 states have return successors, (38), 37 states have call predecessors, (38), 38 states have call successors, (38) [2023-12-16 03:34:00,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 141 transitions. [2023-12-16 03:34:00,130 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 141 transitions. Word has length 121 [2023-12-16 03:34:00,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 03:34:00,130 INFO L495 AbstractCegarLoop]: Abstraction has 95 states and 141 transitions. [2023-12-16 03:34:00,130 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.0) internal successors, (36), 9 states have internal predecessors, (36), 2 states have call successors, (21), 2 states have call predecessors, (21), 4 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2023-12-16 03:34:00,131 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 141 transitions. [2023-12-16 03:34:00,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2023-12-16 03:34:00,132 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 03:34:00,132 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 03:34:00,151 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-12-16 03:34:00,338 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-16 03:34:00,339 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 03:34:00,339 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 03:34:00,339 INFO L85 PathProgramCache]: Analyzing trace with hash -1091332821, now seen corresponding path program 1 times [2023-12-16 03:34:00,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 03:34:00,339 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [337520774] [2023-12-16 03:34:00,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 03:34:00,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 03:34:00,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-16 03:34:00,420 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-16 03:34:00,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-16 03:34:00,489 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-12-16 03:34:00,489 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-12-16 03:34:00,490 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-16 03:34:00,491 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-12-16 03:34:00,493 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2023-12-16 03:34:00,495 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-16 03:34:00,539 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.12 03:34:00 BoogieIcfgContainer [2023-12-16 03:34:00,540 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-16 03:34:00,540 INFO L158 Benchmark]: Toolchain (without parser) took 3051.65ms. Allocated memory was 170.9MB in the beginning and 291.5MB in the end (delta: 120.6MB). Free memory was 125.6MB in the beginning and 140.7MB in the end (delta: -15.1MB). Peak memory consumption was 106.5MB. Max. memory is 8.0GB. [2023-12-16 03:34:00,540 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 170.9MB. Free memory was 124.9MB in the beginning and 124.8MB in the end (delta: 71.2kB). There was no memory consumed. Max. memory is 8.0GB. [2023-12-16 03:34:00,541 INFO L158 Benchmark]: CACSL2BoogieTranslator took 264.86ms. Allocated memory is still 170.9MB. Free memory was 125.6MB in the beginning and 112.7MB in the end (delta: 12.9MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. [2023-12-16 03:34:00,541 INFO L158 Benchmark]: Boogie Procedure Inliner took 48.92ms. Allocated memory is still 170.9MB. Free memory was 112.7MB in the beginning and 110.2MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-16 03:34:00,541 INFO L158 Benchmark]: Boogie Preprocessor took 35.92ms. Allocated memory is still 170.9MB. Free memory was 110.2MB in the beginning and 107.4MB in the end (delta: 2.8MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2023-12-16 03:34:00,541 INFO L158 Benchmark]: RCFGBuilder took 480.49ms. Allocated memory is still 170.9MB. Free memory was 107.4MB in the beginning and 89.6MB in the end (delta: 17.8MB). Peak memory consumption was 17.8MB. Max. memory is 8.0GB. [2023-12-16 03:34:00,542 INFO L158 Benchmark]: TraceAbstraction took 2215.30ms. Allocated memory was 170.9MB in the beginning and 291.5MB in the end (delta: 120.6MB). Free memory was 88.9MB in the beginning and 140.7MB in the end (delta: -51.8MB). Peak memory consumption was 69.8MB. Max. memory is 8.0GB. [2023-12-16 03:34:00,543 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.10ms. Allocated memory is still 170.9MB. Free memory was 124.9MB in the beginning and 124.8MB in the end (delta: 71.2kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 264.86ms. Allocated memory is still 170.9MB. Free memory was 125.6MB in the beginning and 112.7MB in the end (delta: 12.9MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 48.92ms. Allocated memory is still 170.9MB. Free memory was 112.7MB in the beginning and 110.2MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 35.92ms. Allocated memory is still 170.9MB. Free memory was 110.2MB in the beginning and 107.4MB in the end (delta: 2.8MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * RCFGBuilder took 480.49ms. Allocated memory is still 170.9MB. Free memory was 107.4MB in the beginning and 89.6MB in the end (delta: 17.8MB). Peak memory consumption was 17.8MB. Max. memory is 8.0GB. * TraceAbstraction took 2215.30ms. Allocated memory was 170.9MB in the beginning and 291.5MB in the end (delta: 120.6MB). Free memory was 88.9MB in the beginning and 140.7MB in the end (delta: -51.8MB). Peak memory consumption was 69.8MB. 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 to_int at line 105, overapproximation of someBinaryFLOATComparisonOperation at line 105. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned long int var_1_1 = 256; [L23] unsigned char var_1_2 = 0; [L24] unsigned short int var_1_3 = 10; [L25] unsigned short int var_1_4 = 500; [L26] unsigned long int var_1_5 = 0; [L27] unsigned long int var_1_6 = 1509114200; [L28] unsigned long int var_1_7 = 10; [L29] signed long int var_1_8 = 128; [L30] signed long int var_1_9 = 63; [L31] signed long int var_1_10 = 4; [L32] signed long int var_1_11 = 25; [L33] unsigned char var_1_12 = 1; [L34] unsigned char var_1_13 = 0; [L35] unsigned char var_1_14 = 1; [L109] isInitial = 1 [L110] FCALL initially() [L111] COND TRUE 1 [L112] FCALL updateLastVariables() [L113] CALL updateVariables() [L71] var_1_2 = __VERIFIER_nondet_uchar() [L72] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=4, var_1_11=25, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=256, var_1_3=10, var_1_4=500, var_1_5=0, var_1_6=1509114200, var_1_7=10, var_1_8=128, var_1_9=63] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=4, var_1_11=25, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=256, var_1_3=10, var_1_4=500, var_1_5=0, var_1_6=1509114200, var_1_7=10, var_1_8=128, var_1_9=63] [L72] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, var_1_10=4, var_1_11=25, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=256, var_1_3=10, var_1_4=500, var_1_5=0, var_1_6=1509114200, var_1_7=10, var_1_8=128, var_1_9=63] [L73] CALL assume_abort_if_not(var_1_2 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=4, var_1_11=25, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=256, var_1_2=0, var_1_3=10, var_1_4=500, var_1_5=0, var_1_6=1509114200, var_1_7=10, var_1_8=128, var_1_9=63] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=4, var_1_11=25, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=256, var_1_2=0, var_1_3=10, var_1_4=500, var_1_5=0, var_1_6=1509114200, var_1_7=10, var_1_8=128, var_1_9=63] [L73] RET assume_abort_if_not(var_1_2 <= 1) VAL [isInitial=1, var_1_10=4, var_1_11=25, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=256, var_1_2=0, var_1_3=10, var_1_4=500, var_1_5=0, var_1_6=1509114200, var_1_7=10, var_1_8=128, var_1_9=63] [L74] var_1_3 = __VERIFIER_nondet_ushort() [L75] CALL assume_abort_if_not(var_1_3 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=4, var_1_11=25, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=256, var_1_2=0, var_1_4=500, var_1_5=0, var_1_6=1509114200, var_1_7=10, var_1_8=128, var_1_9=63] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=4, var_1_11=25, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=256, var_1_2=0, var_1_4=500, var_1_5=0, var_1_6=1509114200, var_1_7=10, var_1_8=128, var_1_9=63] [L75] RET assume_abort_if_not(var_1_3 >= 0) VAL [isInitial=1, var_1_10=4, var_1_11=25, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=256, var_1_2=0, var_1_4=500, var_1_5=0, var_1_6=1509114200, var_1_7=10, var_1_8=128, var_1_9=63] [L76] CALL assume_abort_if_not(var_1_3 <= 65535) VAL [\old(cond)=1, isInitial=1, var_1_10=4, var_1_11=25, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=256, var_1_2=0, var_1_4=500, var_1_5=0, var_1_6=1509114200, var_1_7=10, var_1_8=128, var_1_9=63] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=4, var_1_11=25, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=256, var_1_2=0, var_1_4=500, var_1_5=0, var_1_6=1509114200, var_1_7=10, var_1_8=128, var_1_9=63] [L76] RET assume_abort_if_not(var_1_3 <= 65535) VAL [isInitial=1, var_1_10=4, var_1_11=25, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=256, var_1_2=0, var_1_4=500, var_1_5=0, var_1_6=1509114200, var_1_7=10, var_1_8=128, var_1_9=63] [L77] var_1_4 = __VERIFIER_nondet_ushort() [L78] CALL assume_abort_if_not(var_1_4 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=4, var_1_11=25, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=256, var_1_2=0, var_1_5=0, var_1_6=1509114200, var_1_7=10, var_1_8=128, var_1_9=63] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=4, var_1_11=25, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=256, var_1_2=0, var_1_5=0, var_1_6=1509114200, var_1_7=10, var_1_8=128, var_1_9=63] [L78] RET assume_abort_if_not(var_1_4 >= 0) VAL [isInitial=1, var_1_10=4, var_1_11=25, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=256, var_1_2=0, var_1_5=0, var_1_6=1509114200, var_1_7=10, var_1_8=128, var_1_9=63] [L79] CALL assume_abort_if_not(var_1_4 <= 65535) VAL [\old(cond)=1, isInitial=1, var_1_10=4, var_1_11=25, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=256, var_1_2=0, var_1_5=0, var_1_6=1509114200, var_1_7=10, var_1_8=128, var_1_9=63] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=4, var_1_11=25, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=256, var_1_2=0, var_1_5=0, var_1_6=1509114200, var_1_7=10, var_1_8=128, var_1_9=63] [L79] RET assume_abort_if_not(var_1_4 <= 65535) VAL [isInitial=1, var_1_10=4, var_1_11=25, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=256, var_1_2=0, var_1_5=0, var_1_6=1509114200, var_1_7=10, var_1_8=128, var_1_9=63] [L80] var_1_5 = __VERIFIER_nondet_ulong() [L81] CALL assume_abort_if_not(var_1_5 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=4, var_1_11=25, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=256, var_1_2=0, var_1_6=1509114200, var_1_7=10, var_1_8=128, var_1_9=63] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=4, var_1_11=25, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=256, var_1_2=0, var_1_6=1509114200, var_1_7=10, var_1_8=128, var_1_9=63] [L81] RET assume_abort_if_not(var_1_5 >= 0) VAL [isInitial=1, var_1_10=4, var_1_11=25, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=256, var_1_2=0, var_1_6=1509114200, var_1_7=10, var_1_8=128, var_1_9=63] [L82] CALL assume_abort_if_not(var_1_5 <= 1073741823) VAL [\old(cond)=1, isInitial=1, var_1_10=4, var_1_11=25, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=256, var_1_2=0, var_1_5=0, var_1_6=1509114200, var_1_7=10, var_1_8=128, var_1_9=63] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=4, var_1_11=25, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=256, var_1_2=0, var_1_5=0, var_1_6=1509114200, var_1_7=10, var_1_8=128, var_1_9=63] [L82] RET assume_abort_if_not(var_1_5 <= 1073741823) VAL [isInitial=1, var_1_10=4, var_1_11=25, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=256, var_1_2=0, var_1_5=0, var_1_6=1509114200, var_1_7=10, var_1_8=128, var_1_9=63] [L83] var_1_6 = __VERIFIER_nondet_ulong() [L84] CALL assume_abort_if_not(var_1_6 >= 1073741823) VAL [\old(cond)=1, isInitial=1, var_1_10=4, var_1_11=25, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=256, var_1_2=0, var_1_5=0, var_1_6=1073741823, var_1_7=10, var_1_8=128, var_1_9=63] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=4, var_1_11=25, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=256, var_1_2=0, var_1_5=0, var_1_6=1073741823, var_1_7=10, var_1_8=128, var_1_9=63] [L84] RET assume_abort_if_not(var_1_6 >= 1073741823) VAL [isInitial=1, var_1_10=4, var_1_11=25, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=256, var_1_2=0, var_1_5=0, var_1_6=1073741823, var_1_7=10, var_1_8=128, var_1_9=63] [L85] CALL assume_abort_if_not(var_1_6 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=4, var_1_11=25, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=256, var_1_2=0, var_1_5=0, var_1_6=1073741823, var_1_7=10, var_1_8=128, var_1_9=63] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=4, var_1_11=25, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=256, var_1_2=0, var_1_5=0, var_1_6=1073741823, var_1_7=10, var_1_8=128, var_1_9=63] [L85] RET assume_abort_if_not(var_1_6 <= 2147483647) VAL [isInitial=1, var_1_10=4, var_1_11=25, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=256, var_1_2=0, var_1_5=0, var_1_6=1073741823, var_1_7=10, var_1_8=128, var_1_9=63] [L86] var_1_7 = __VERIFIER_nondet_ulong() [L87] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=4, var_1_11=25, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=256, var_1_2=0, var_1_5=0, var_1_6=1073741823, var_1_8=128, var_1_9=63] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=4, var_1_11=25, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=256, var_1_2=0, var_1_5=0, var_1_6=1073741823, var_1_8=128, var_1_9=63] [L87] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, var_1_10=4, var_1_11=25, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=256, var_1_2=0, var_1_5=0, var_1_6=1073741823, var_1_8=128, var_1_9=63] [L88] CALL assume_abort_if_not(var_1_7 <= 1073741823) VAL [\old(cond)=1, isInitial=1, var_1_10=4, var_1_11=25, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=256, var_1_2=0, var_1_5=0, var_1_6=1073741823, var_1_7=1073741823, var_1_8=128, var_1_9=63] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=4, var_1_11=25, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=256, var_1_2=0, var_1_5=0, var_1_6=1073741823, var_1_7=1073741823, var_1_8=128, var_1_9=63] [L88] RET assume_abort_if_not(var_1_7 <= 1073741823) VAL [isInitial=1, var_1_10=4, var_1_11=25, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=256, var_1_2=0, var_1_5=0, var_1_6=1073741823, var_1_7=1073741823, var_1_8=128, var_1_9=63] [L89] var_1_9 = __VERIFIER_nondet_long() [L90] CALL assume_abort_if_not(var_1_9 >= -2147483648) VAL [\old(cond)=1, isInitial=1, var_1_10=4, var_1_11=25, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=256, var_1_2=0, var_1_5=0, var_1_6=1073741823, var_1_7=1073741823, var_1_8=128, var_1_9=-1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=4, var_1_11=25, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=256, var_1_2=0, var_1_5=0, var_1_6=1073741823, var_1_7=1073741823, var_1_8=128, var_1_9=-1] [L90] RET assume_abort_if_not(var_1_9 >= -2147483648) VAL [isInitial=1, var_1_10=4, var_1_11=25, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=256, var_1_2=0, var_1_5=0, var_1_6=1073741823, var_1_7=1073741823, var_1_8=128, var_1_9=-1] [L91] CALL assume_abort_if_not(var_1_9 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=4, var_1_11=25, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=256, var_1_2=0, var_1_5=0, var_1_6=1073741823, var_1_7=1073741823, var_1_8=128, var_1_9=-1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=4, var_1_11=25, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=256, var_1_2=0, var_1_5=0, var_1_6=1073741823, var_1_7=1073741823, var_1_8=128, var_1_9=-1] [L91] RET assume_abort_if_not(var_1_9 <= 2147483647) VAL [isInitial=1, var_1_10=4, var_1_11=25, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=256, var_1_2=0, var_1_5=0, var_1_6=1073741823, var_1_7=1073741823, var_1_8=128, var_1_9=-1] [L92] var_1_10 = __VERIFIER_nondet_long() [L93] CALL assume_abort_if_not(var_1_10 >= -2147483648) VAL [\old(cond)=1, isInitial=1, var_1_10=-1, var_1_11=25, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=256, var_1_2=0, var_1_5=0, var_1_6=1073741823, var_1_7=1073741823, var_1_8=128, var_1_9=-1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=-1, var_1_11=25, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=256, var_1_2=0, var_1_5=0, var_1_6=1073741823, var_1_7=1073741823, var_1_8=128, var_1_9=-1] [L93] RET assume_abort_if_not(var_1_10 >= -2147483648) VAL [isInitial=1, var_1_10=-1, var_1_11=25, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=256, var_1_2=0, var_1_5=0, var_1_6=1073741823, var_1_7=1073741823, var_1_8=128, var_1_9=-1] [L94] CALL assume_abort_if_not(var_1_10 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=-1, var_1_11=25, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=256, var_1_2=0, var_1_5=0, var_1_6=1073741823, var_1_7=1073741823, var_1_8=128, var_1_9=-1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=-1, var_1_11=25, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=256, var_1_2=0, var_1_5=0, var_1_6=1073741823, var_1_7=1073741823, var_1_8=128, var_1_9=-1] [L94] RET assume_abort_if_not(var_1_10 <= 2147483647) VAL [isInitial=1, var_1_10=-1, var_1_11=25, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=256, var_1_2=0, var_1_5=0, var_1_6=1073741823, var_1_7=1073741823, var_1_8=128, var_1_9=-1] [L95] var_1_13 = __VERIFIER_nondet_uchar() [L96] CALL assume_abort_if_not(var_1_13 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=-1, var_1_11=25, var_1_12=1, var_1_14=1, var_1_1=256, var_1_2=0, var_1_5=0, var_1_6=1073741823, var_1_7=1073741823, var_1_8=128, var_1_9=-1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=-1, var_1_11=25, var_1_12=1, var_1_14=1, var_1_1=256, var_1_2=0, var_1_5=0, var_1_6=1073741823, var_1_7=1073741823, var_1_8=128, var_1_9=-1] [L96] RET assume_abort_if_not(var_1_13 >= 0) VAL [isInitial=1, var_1_10=-1, var_1_11=25, var_1_12=1, var_1_14=1, var_1_1=256, var_1_2=0, var_1_5=0, var_1_6=1073741823, var_1_7=1073741823, var_1_8=128, var_1_9=-1] [L97] CALL assume_abort_if_not(var_1_13 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=-1, var_1_11=25, var_1_12=1, var_1_13=1, var_1_14=1, var_1_1=256, var_1_2=0, var_1_5=0, var_1_6=1073741823, var_1_7=1073741823, var_1_8=128, var_1_9=-1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=-1, var_1_11=25, var_1_12=1, var_1_13=1, var_1_14=1, var_1_1=256, var_1_2=0, var_1_5=0, var_1_6=1073741823, var_1_7=1073741823, var_1_8=128, var_1_9=-1] [L97] RET assume_abort_if_not(var_1_13 <= 1) VAL [isInitial=1, var_1_10=-1, var_1_11=25, var_1_12=1, var_1_13=1, var_1_14=1, var_1_1=256, var_1_2=0, var_1_5=0, var_1_6=1073741823, var_1_7=1073741823, var_1_8=128, var_1_9=-1] [L98] var_1_14 = __VERIFIER_nondet_uchar() [L99] CALL assume_abort_if_not(var_1_14 >= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=-1, var_1_11=25, var_1_12=1, var_1_13=1, var_1_14=1, var_1_1=256, var_1_2=0, var_1_5=0, var_1_6=1073741823, var_1_7=1073741823, var_1_8=128, var_1_9=-1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=-1, var_1_11=25, var_1_12=1, var_1_13=1, var_1_14=1, var_1_1=256, var_1_2=0, var_1_5=0, var_1_6=1073741823, var_1_7=1073741823, var_1_8=128, var_1_9=-1] [L99] RET assume_abort_if_not(var_1_14 >= 1) VAL [isInitial=1, var_1_10=-1, var_1_11=25, var_1_12=1, var_1_13=1, var_1_14=1, var_1_1=256, var_1_2=0, var_1_5=0, var_1_6=1073741823, var_1_7=1073741823, var_1_8=128, var_1_9=-1] [L100] CALL assume_abort_if_not(var_1_14 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=-1, var_1_11=25, var_1_12=1, var_1_13=1, var_1_14=1, var_1_1=256, var_1_2=0, var_1_5=0, var_1_6=1073741823, var_1_7=1073741823, var_1_8=128, var_1_9=-1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=-1, var_1_11=25, var_1_12=1, var_1_13=1, var_1_14=1, var_1_1=256, var_1_2=0, var_1_5=0, var_1_6=1073741823, var_1_7=1073741823, var_1_8=128, var_1_9=-1] [L100] RET assume_abort_if_not(var_1_14 <= 1) VAL [isInitial=1, var_1_10=-1, var_1_11=25, var_1_12=1, var_1_13=1, var_1_14=1, var_1_1=256, var_1_2=0, var_1_5=0, var_1_6=1073741823, var_1_7=1073741823, var_1_8=128, var_1_9=-1] [L113] RET updateVariables() [L114] CALL step() [L39] COND FALSE !(var_1_9 != var_1_10) [L46] var_1_12 = var_1_14 VAL [isInitial=1, var_1_10=-1, var_1_11=25, var_1_12=1, var_1_13=1, var_1_14=1, var_1_1=256, var_1_2=0, var_1_5=0, var_1_6=1073741823, var_1_7=1073741823, var_1_8=128, var_1_9=-1] [L48] unsigned short int stepLocal_0 = var_1_3; VAL [isInitial=1, stepLocal_0=0, var_1_10=-1, var_1_11=25, var_1_12=1, var_1_13=1, var_1_14=1, var_1_1=256, var_1_2=0, var_1_3=0, var_1_5=0, var_1_6=1073741823, var_1_7=1073741823, var_1_8=128, var_1_9=-1] [L49] COND TRUE \read(var_1_12) VAL [isInitial=1, stepLocal_0=0, var_1_10=-1, var_1_11=25, var_1_12=1, var_1_13=1, var_1_14=1, var_1_1=256, var_1_2=0, var_1_3=0, var_1_5=0, var_1_6=1073741823, var_1_7=1073741823, var_1_8=128, var_1_9=-1] [L50] COND TRUE stepLocal_0 <= var_1_4 [L51] var_1_1 = (((((var_1_3) > ((var_1_4 + var_1_5))) ? (var_1_3) : ((var_1_4 + var_1_5)))) + (var_1_6 - var_1_7)) VAL [isInitial=1, stepLocal_0=0, var_1_10=-1, var_1_11=25, var_1_12=1, var_1_13=1, var_1_14=1, var_1_1=0, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=1073741823, var_1_7=1073741823, var_1_8=128, var_1_9=-1] [L56] unsigned long int stepLocal_1 = var_1_1; VAL [isInitial=1, stepLocal_0=0, stepLocal_1=0, var_1_10=-1, var_1_11=25, var_1_12=1, var_1_13=1, var_1_14=1, var_1_1=0, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=1073741823, var_1_7=1073741823, var_1_8=128, var_1_9=-1] [L57] COND TRUE var_1_7 >= stepLocal_1 [L58] var_1_8 = ((((0.5f) < (var_1_9)) ? (0.5f) : (var_1_9))) VAL [isInitial=1, stepLocal_0=0, stepLocal_1=0, var_1_10=-1, var_1_11=25, var_1_12=1, var_1_13=1, var_1_14=1, var_1_1=0, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=1073741823, var_1_7=1073741823, var_1_9=-1] [L62] COND TRUE var_1_10 >= ((((((((128.175f) > (var_1_9)) ? (128.175f) : (var_1_9)))) < (var_1_8)) ? (((((128.175f) > (var_1_9)) ? (128.175f) : (var_1_9)))) : (var_1_8))) [L63] var_1_11 = var_1_10 VAL [isInitial=1, stepLocal_0=0, stepLocal_1=0, var_1_10=-1, var_1_11=-1, var_1_12=1, var_1_13=1, var_1_14=1, var_1_1=0, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=1073741823, var_1_7=1073741823, var_1_9=-1] [L114] RET step() [L115] CALL, EXPR property() [L105-L106] return (((var_1_12 ? ((var_1_3 <= var_1_4) ? (var_1_1 == ((unsigned long int) (((((var_1_3) > ((var_1_4 + var_1_5))) ? (var_1_3) : ((var_1_4 + var_1_5)))) + (var_1_6 - var_1_7)))) : 1) : (var_1_1 == ((unsigned long int) var_1_7))) && ((var_1_7 >= var_1_1) ? (var_1_8 == ((signed long int) ((((0.5f) < (var_1_9)) ? (0.5f) : (var_1_9))))) : (var_1_8 == ((signed long int) ((((var_1_9) < (var_1_10)) ? (var_1_9) : (var_1_10))))))) && ((var_1_10 >= ((((((((128.175f) > (var_1_9)) ? (128.175f) : (var_1_9)))) < (var_1_8)) ? (((((128.175f) > (var_1_9)) ? (128.175f) : (var_1_9)))) : (var_1_8)))) ? (var_1_11 == ((signed long int) var_1_10)) : ((! (var_1_7 <= var_1_6)) ? (var_1_11 == ((signed long int) var_1_9)) : 1))) && ((var_1_9 != var_1_10) ? ((var_1_2 || var_1_13) ? (var_1_12 == ((unsigned char) (var_1_13 || var_1_14))) : (var_1_12 == ((unsigned char) var_1_14))) : (var_1_12 == ((unsigned char) var_1_14))) ; [L115] RET, EXPR property() [L115] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [\old(cond)=0, cond=0, isInitial=1, var_1_10=-1, var_1_11=-1, var_1_12=1, var_1_13=1, var_1_14=1, var_1_1=0, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=1073741823, var_1_7=1073741823, var_1_8=8589934594, var_1_9=-1] [L19] reach_error() VAL [\old(cond)=0, cond=0, isInitial=1, var_1_10=-1, var_1_11=-1, var_1_12=1, var_1_13=1, var_1_14=1, var_1_1=0, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=1073741823, var_1_7=1073741823, var_1_8=8589934594, var_1_9=-1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 52 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 2.1s, OverallIterations: 3, TraceHistogramMax: 20, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 177 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 176 mSDsluCounter, 197 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 78 mSDsCounter, 239 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 170 IncrementalHoareTripleChecker+Invalid, 409 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 239 mSolverCounterUnsat, 119 mSDtfsCounter, 170 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 360 GetRequests, 340 SyntacticMatches, 3 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=95occurred in iteration=2, InterpolantAutomatonStates: 15, 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, 2 MinimizatonAttempts, 7 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 485 NumberOfCodeBlocks, 485 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 480 ConstructedInterpolants, 0 QuantifiedInterpolants, 700 SizeOfPredicates, 4 NumberOfNonLiveVariables, 273 ConjunctsInSsa, 8 ConjunctsInUnsatCore, 4 InterpolantComputations, 1 PerfectInterpolantSequences, 3031/3040 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 03:34:00,573 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...