./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-27.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-27.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash b2a57ed806019e2a314732595f6a56c6ec2b2df5289c00e3d1fce673fb6d9182 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-08 20:17:20,429 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 20:17:20,504 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-08 20:17:20,511 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 20:17:20,512 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 20:17:20,549 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 20:17:20,550 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 20:17:20,551 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 20:17:20,551 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 20:17:20,553 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 20:17:20,553 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 20:17:20,553 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 20:17:20,554 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 20:17:20,555 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 20:17:20,557 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 20:17:20,558 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 20:17:20,558 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 20:17:20,558 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 20:17:20,558 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 20:17:20,559 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 20:17:20,559 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 20:17:20,560 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 20:17:20,560 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 20:17:20,560 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 20:17:20,560 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 20:17:20,561 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 20:17:20,561 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 20:17:20,561 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 20:17:20,562 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 20:17:20,562 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 20:17:20,562 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 20:17:20,562 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 20:17:20,563 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 20:17:20,563 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 20:17:20,567 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 20:17:20,568 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 20:17:20,569 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-08 20:17:20,569 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-08 20:17:20,569 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 20:17:20,570 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 20:17:20,570 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 20:17:20,571 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 20:17:20,571 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: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> b2a57ed806019e2a314732595f6a56c6ec2b2df5289c00e3d1fce673fb6d9182 [2024-11-08 20:17:20,822 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 20:17:20,849 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 20:17:20,852 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 20:17:20,853 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 20:17:20,854 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 20:17:20,855 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-27.i [2024-11-08 20:17:22,276 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 20:17:22,497 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 20:17:22,498 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-27.i [2024-11-08 20:17:22,509 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/92edee1ca/708f143747e540d1aac145d106c66d59/FLAG611ec124f [2024-11-08 20:17:22,858 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/92edee1ca/708f143747e540d1aac145d106c66d59 [2024-11-08 20:17:22,862 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 20:17:22,867 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 20:17:22,869 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 20:17:22,869 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 20:17:22,875 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 20:17:22,875 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 08:17:22" (1/1) ... [2024-11-08 20:17:22,876 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3c73aba7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:17:22, skipping insertion in model container [2024-11-08 20:17:22,876 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 08:17:22" (1/1) ... [2024-11-08 20:17:22,901 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 20:17:23,079 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-27.i[915,928] [2024-11-08 20:17:23,142 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 20:17:23,155 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 20:17:23,167 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-27.i[915,928] [2024-11-08 20:17:23,216 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 20:17:23,249 INFO L204 MainTranslator]: Completed translation [2024-11-08 20:17:23,250 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:17:23 WrapperNode [2024-11-08 20:17:23,250 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 20:17:23,251 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 20:17:23,252 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 20:17:23,252 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 20:17:23,259 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:17:23" (1/1) ... [2024-11-08 20:17:23,269 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:17:23" (1/1) ... [2024-11-08 20:17:23,305 INFO L138 Inliner]: procedures = 26, calls = 42, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 201 [2024-11-08 20:17:23,306 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 20:17:23,306 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 20:17:23,306 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 20:17:23,307 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 20:17:23,322 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:17:23" (1/1) ... [2024-11-08 20:17:23,322 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:17:23" (1/1) ... [2024-11-08 20:17:23,325 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:17:23" (1/1) ... [2024-11-08 20:17:23,342 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]. [2024-11-08 20:17:23,343 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:17:23" (1/1) ... [2024-11-08 20:17:23,343 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:17:23" (1/1) ... [2024-11-08 20:17:23,354 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:17:23" (1/1) ... [2024-11-08 20:17:23,357 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:17:23" (1/1) ... [2024-11-08 20:17:23,360 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:17:23" (1/1) ... [2024-11-08 20:17:23,362 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:17:23" (1/1) ... [2024-11-08 20:17:23,366 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 20:17:23,367 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 20:17:23,368 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 20:17:23,368 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 20:17:23,368 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:17:23" (1/1) ... [2024-11-08 20:17:23,383 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 20:17:23,395 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 20:17:23,414 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) [2024-11-08 20:17:23,420 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 [2024-11-08 20:17:23,464 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 20:17:23,465 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-08 20:17:23,466 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-08 20:17:23,466 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-08 20:17:23,466 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 20:17:23,466 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 20:17:23,574 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 20:17:23,576 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 20:17:23,920 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2024-11-08 20:17:23,920 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 20:17:23,935 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 20:17:23,935 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 20:17:23,936 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 08:17:23 BoogieIcfgContainer [2024-11-08 20:17:23,936 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 20:17:23,941 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 20:17:23,941 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 20:17:23,944 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 20:17:23,944 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 08:17:22" (1/3) ... [2024-11-08 20:17:23,946 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a29a34f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 08:17:23, skipping insertion in model container [2024-11-08 20:17:23,946 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:17:23" (2/3) ... [2024-11-08 20:17:23,946 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a29a34f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 08:17:23, skipping insertion in model container [2024-11-08 20:17:23,947 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 08:17:23" (3/3) ... [2024-11-08 20:17:23,948 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-10_file-27.i [2024-11-08 20:17:23,965 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 20:17:23,965 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 20:17:24,024 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 20:17:24,031 INFO L333 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, 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;@7d3465ca, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 20:17:24,031 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 20:17:24,034 INFO L276 IsEmpty]: Start isEmpty. Operand has 85 states, 53 states have (on average 1.3396226415094339) internal successors, (71), 54 states have internal predecessors, (71), 29 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2024-11-08 20:17:24,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2024-11-08 20:17:24,052 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 20:17:24,053 INFO L215 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 20:17:24,053 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 20:17:24,059 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 20:17:24,059 INFO L85 PathProgramCache]: Analyzing trace with hash -439682076, now seen corresponding path program 1 times [2024-11-08 20:17:24,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 20:17:24,071 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [152207110] [2024-11-08 20:17:24,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 20:17:24,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 20:17:24,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:17:24,434 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 20:17:24,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:17:24,444 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 20:17:24,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:17:24,451 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 20:17:24,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:17:24,463 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 20:17:24,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:17:24,475 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 20:17:24,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:17:24,483 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-08 20:17:24,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:17:24,492 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-08 20:17:24,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:17:24,501 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-08 20:17:24,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:17:24,507 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-08 20:17:24,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:17:24,512 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-08 20:17:24,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:17:24,517 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-08 20:17:24,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:17:24,524 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-08 20:17:24,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:17:24,532 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-08 20:17:24,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:17:24,536 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-08 20:17:24,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:17:24,540 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-08 20:17:24,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:17:24,549 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 20:17:24,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:17:24,560 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-08 20:17:24,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:17:24,566 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-08 20:17:24,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:17:24,572 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-08 20:17:24,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:17:24,578 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-08 20:17:24,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:17:24,583 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-08 20:17:24,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:17:24,588 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-08 20:17:24,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:17:24,594 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-08 20:17:24,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:17:24,599 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-08 20:17:24,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:17:24,605 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-08 20:17:24,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:17:24,609 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-11-08 20:17:24,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:17:24,613 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-11-08 20:17:24,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:17:24,620 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2024-11-08 20:17:24,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:17:24,625 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-11-08 20:17:24,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:17:24,636 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2024-11-08 20:17:24,637 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 20:17:24,637 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [152207110] [2024-11-08 20:17:24,638 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [152207110] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 20:17:24,638 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 20:17:24,638 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 20:17:24,640 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2081188683] [2024-11-08 20:17:24,641 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 20:17:24,646 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-08 20:17:24,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 20:17:24,673 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-08 20:17:24,674 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 20:17:24,676 INFO L87 Difference]: Start difference. First operand has 85 states, 53 states have (on average 1.3396226415094339) internal successors, (71), 54 states have internal predecessors, (71), 29 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) Second operand has 2 states, 2 states have (on average 20.0) internal successors, (40), 2 states have internal predecessors, (40), 2 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 2 states have call successors, (29) [2024-11-08 20:17:24,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 20:17:24,716 INFO L93 Difference]: Finished difference Result 163 states and 281 transitions. [2024-11-08 20:17:24,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 20:17:24,719 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 20.0) internal successors, (40), 2 states have internal predecessors, (40), 2 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 2 states have call successors, (29) Word has length 182 [2024-11-08 20:17:24,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 20:17:24,728 INFO L225 Difference]: With dead ends: 163 [2024-11-08 20:17:24,728 INFO L226 Difference]: Without dead ends: 81 [2024-11-08 20:17:24,734 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 20:17:24,739 INFO L432 NwaCegarLoop]: 122 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 122 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 20:17:24,743 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 122 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 20:17:24,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2024-11-08 20:17:24,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2024-11-08 20:17:24,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 50 states have (on average 1.28) internal successors, (64), 50 states have internal predecessors, (64), 29 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2024-11-08 20:17:24,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 122 transitions. [2024-11-08 20:17:24,859 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 122 transitions. Word has length 182 [2024-11-08 20:17:24,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 20:17:24,859 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 122 transitions. [2024-11-08 20:17:24,860 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 20.0) internal successors, (40), 2 states have internal predecessors, (40), 2 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 2 states have call successors, (29) [2024-11-08 20:17:24,860 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 122 transitions. [2024-11-08 20:17:24,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2024-11-08 20:17:24,866 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 20:17:24,866 INFO L215 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 20:17:24,866 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-08 20:17:24,867 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 20:17:24,867 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 20:17:24,867 INFO L85 PathProgramCache]: Analyzing trace with hash 365626094, now seen corresponding path program 1 times [2024-11-08 20:17:24,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 20:17:24,868 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1277067969] [2024-11-08 20:17:24,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 20:17:24,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 20:17:24,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:17:25,248 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 20:17:25,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:17:25,255 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 20:17:25,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:17:25,262 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 20:17:25,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:17:25,268 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 20:17:25,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:17:25,274 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 20:17:25,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:17:25,281 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-08 20:17:25,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:17:25,292 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-08 20:17:25,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:17:25,296 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-08 20:17:25,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:17:25,299 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-08 20:17:25,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:17:25,302 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-08 20:17:25,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:17:25,307 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-08 20:17:25,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:17:25,313 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-08 20:17:25,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:17:25,319 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-08 20:17:25,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:17:25,326 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-08 20:17:25,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:17:25,331 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-08 20:17:25,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:17:25,336 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 20:17:25,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:17:25,342 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-08 20:17:25,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:17:25,348 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-08 20:17:25,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:17:25,353 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-08 20:17:25,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:17:25,359 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-08 20:17:25,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:17:25,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-08 20:17:25,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:17:25,374 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-08 20:17:25,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:17:25,382 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-08 20:17:25,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:17:25,388 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-08 20:17:25,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:17:25,392 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-08 20:17:25,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:17:25,396 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-11-08 20:17:25,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:17:25,401 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-11-08 20:17:25,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:17:25,408 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2024-11-08 20:17:25,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:17:25,413 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-11-08 20:17:25,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:17:25,419 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2024-11-08 20:17:25,421 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 20:17:25,421 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1277067969] [2024-11-08 20:17:25,421 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1277067969] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 20:17:25,421 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 20:17:25,422 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 20:17:25,422 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [941839269] [2024-11-08 20:17:25,422 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 20:17:25,424 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 20:17:25,424 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 20:17:25,426 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 20:17:25,426 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 20:17:25,426 INFO L87 Difference]: Start difference. First operand 81 states and 122 transitions. Second operand has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2024-11-08 20:17:25,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 20:17:25,505 INFO L93 Difference]: Finished difference Result 237 states and 360 transitions. [2024-11-08 20:17:25,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 20:17:25,506 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) Word has length 182 [2024-11-08 20:17:25,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 20:17:25,514 INFO L225 Difference]: With dead ends: 237 [2024-11-08 20:17:25,515 INFO L226 Difference]: Without dead ends: 159 [2024-11-08 20:17:25,517 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 20:17:25,519 INFO L432 NwaCegarLoop]: 117 mSDtfsCounter, 60 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 226 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 20:17:25,520 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 226 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 20:17:25,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2024-11-08 20:17:25,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 155. [2024-11-08 20:17:25,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 94 states have (on average 1.2553191489361701) internal successors, (118), 94 states have internal predecessors, (118), 58 states have call successors, (58), 2 states have call predecessors, (58), 2 states have return successors, (58), 58 states have call predecessors, (58), 58 states have call successors, (58) [2024-11-08 20:17:25,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 234 transitions. [2024-11-08 20:17:25,563 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 234 transitions. Word has length 182 [2024-11-08 20:17:25,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 20:17:25,564 INFO L471 AbstractCegarLoop]: Abstraction has 155 states and 234 transitions. [2024-11-08 20:17:25,565 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2024-11-08 20:17:25,565 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 234 transitions. [2024-11-08 20:17:25,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2024-11-08 20:17:25,567 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 20:17:25,568 INFO L215 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 20:17:25,568 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-08 20:17:25,571 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 20:17:25,571 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 20:17:25,571 INFO L85 PathProgramCache]: Analyzing trace with hash -656179248, now seen corresponding path program 1 times [2024-11-08 20:17:25,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 20:17:25,572 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1104012466] [2024-11-08 20:17:25,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 20:17:25,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 20:17:25,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:17:26,058 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 20:17:26,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:17:26,065 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 20:17:26,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:17:26,071 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 20:17:26,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:17:26,078 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 20:17:26,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:17:26,080 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 20:17:26,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:17:26,082 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-08 20:17:26,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:17:26,084 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-08 20:17:26,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:17:26,086 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-08 20:17:26,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:17:26,088 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-08 20:17:26,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:17:26,093 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-08 20:17:26,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:17:26,096 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-08 20:17:26,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:17:26,107 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-08 20:17:26,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:17:26,110 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-08 20:17:26,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:17:26,112 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-08 20:17:26,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:17:26,115 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-08 20:17:26,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:17:26,118 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 20:17:26,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:17:26,120 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-08 20:17:26,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:17:26,121 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-08 20:17:26,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:17:26,124 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-08 20:17:26,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:17:26,125 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-08 20:17:26,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:17:26,127 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-08 20:17:26,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:17:26,129 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-08 20:17:26,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:17:26,131 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-08 20:17:26,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:17:26,133 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-08 20:17:26,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:17:26,135 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-08 20:17:26,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:17:26,137 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-11-08 20:17:26,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:17:26,139 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-11-08 20:17:26,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:17:26,141 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2024-11-08 20:17:26,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:17:26,143 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-11-08 20:17:26,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:17:26,146 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2024-11-08 20:17:26,146 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 20:17:26,146 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1104012466] [2024-11-08 20:17:26,146 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1104012466] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 20:17:26,146 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 20:17:26,146 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 20:17:26,147 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1591048863] [2024-11-08 20:17:26,147 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 20:17:26,147 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 20:17:26,147 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 20:17:26,148 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 20:17:26,148 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-08 20:17:26,149 INFO L87 Difference]: Start difference. First operand 155 states and 234 transitions. Second operand has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2024-11-08 20:17:26,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 20:17:26,378 INFO L93 Difference]: Finished difference Result 309 states and 469 transitions. [2024-11-08 20:17:26,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 20:17:26,382 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) Word has length 183 [2024-11-08 20:17:26,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 20:17:26,385 INFO L225 Difference]: With dead ends: 309 [2024-11-08 20:17:26,385 INFO L226 Difference]: Without dead ends: 157 [2024-11-08 20:17:26,389 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-08 20:17:26,390 INFO L432 NwaCegarLoop]: 114 mSDtfsCounter, 120 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 164 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-08 20:17:26,393 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 164 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-08 20:17:26,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2024-11-08 20:17:26,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 157. [2024-11-08 20:17:26,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 96 states have (on average 1.25) internal successors, (120), 96 states have internal predecessors, (120), 58 states have call successors, (58), 2 states have call predecessors, (58), 2 states have return successors, (58), 58 states have call predecessors, (58), 58 states have call successors, (58) [2024-11-08 20:17:26,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 236 transitions. [2024-11-08 20:17:26,426 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 236 transitions. Word has length 183 [2024-11-08 20:17:26,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 20:17:26,427 INFO L471 AbstractCegarLoop]: Abstraction has 157 states and 236 transitions. [2024-11-08 20:17:26,427 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2024-11-08 20:17:26,428 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 236 transitions. [2024-11-08 20:17:26,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2024-11-08 20:17:26,430 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 20:17:26,430 INFO L215 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 20:17:26,430 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-08 20:17:26,431 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 20:17:26,431 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 20:17:26,431 INFO L85 PathProgramCache]: Analyzing trace with hash -502819398, now seen corresponding path program 1 times [2024-11-08 20:17:26,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 20:17:26,432 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1460322638] [2024-11-08 20:17:26,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 20:17:26,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 20:17:26,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 20:17:26,601 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-08 20:17:26,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 20:17:26,788 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-08 20:17:26,789 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-08 20:17:26,790 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-08 20:17:26,792 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-08 20:17:26,795 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-11-08 20:17:26,927 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-08 20:17:26,932 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.11 08:17:26 BoogieIcfgContainer [2024-11-08 20:17:26,932 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-08 20:17:26,933 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-08 20:17:26,933 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-08 20:17:26,933 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-08 20:17:26,934 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 08:17:23" (3/4) ... [2024-11-08 20:17:26,938 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-08 20:17:26,939 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-08 20:17:26,940 INFO L158 Benchmark]: Toolchain (without parser) took 4072.90ms. Allocated memory was 142.6MB in the beginning and 213.9MB in the end (delta: 71.3MB). Free memory was 70.5MB in the beginning and 124.2MB in the end (delta: -53.7MB). Peak memory consumption was 18.7MB. Max. memory is 16.1GB. [2024-11-08 20:17:26,940 INFO L158 Benchmark]: CDTParser took 0.23ms. Allocated memory is still 142.6MB. Free memory is still 91.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 20:17:26,941 INFO L158 Benchmark]: CACSL2BoogieTranslator took 381.55ms. Allocated memory was 142.6MB in the beginning and 213.9MB in the end (delta: 71.3MB). Free memory was 70.3MB in the beginning and 184.7MB in the end (delta: -114.4MB). Peak memory consumption was 22.2MB. Max. memory is 16.1GB. [2024-11-08 20:17:26,944 INFO L158 Benchmark]: Boogie Procedure Inliner took 54.21ms. Allocated memory is still 213.9MB. Free memory was 184.7MB in the beginning and 181.6MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-08 20:17:26,945 INFO L158 Benchmark]: Boogie Preprocessor took 59.86ms. Allocated memory is still 213.9MB. Free memory was 180.5MB in the beginning and 177.4MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-08 20:17:26,945 INFO L158 Benchmark]: RCFGBuilder took 568.51ms. Allocated memory is still 213.9MB. Free memory was 177.4MB in the beginning and 154.3MB in the end (delta: 23.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2024-11-08 20:17:26,945 INFO L158 Benchmark]: TraceAbstraction took 2991.99ms. Allocated memory is still 213.9MB. Free memory was 153.3MB in the beginning and 124.2MB in the end (delta: 29.1MB). Peak memory consumption was 28.0MB. Max. memory is 16.1GB. [2024-11-08 20:17:26,946 INFO L158 Benchmark]: Witness Printer took 6.13ms. Allocated memory is still 213.9MB. Free memory is still 124.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 20:17:26,947 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.23ms. Allocated memory is still 142.6MB. Free memory is still 91.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 381.55ms. Allocated memory was 142.6MB in the beginning and 213.9MB in the end (delta: 71.3MB). Free memory was 70.3MB in the beginning and 184.7MB in the end (delta: -114.4MB). Peak memory consumption was 22.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 54.21ms. Allocated memory is still 213.9MB. Free memory was 184.7MB in the beginning and 181.6MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 59.86ms. Allocated memory is still 213.9MB. Free memory was 180.5MB in the beginning and 177.4MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 568.51ms. Allocated memory is still 213.9MB. Free memory was 177.4MB in the beginning and 154.3MB in the end (delta: 23.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * TraceAbstraction took 2991.99ms. Allocated memory is still 213.9MB. Free memory was 153.3MB in the beginning and 124.2MB in the end (delta: 29.1MB). Peak memory consumption was 28.0MB. Max. memory is 16.1GB. * Witness Printer took 6.13ms. Allocated memory is still 213.9MB. Free memory is still 124.2MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 158, overapproximation of someBinaryDOUBLEComparisonOperation at line 147, overapproximation of someBinaryArithmeticFLOAToperation at line 91. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] float var_1_1 = 3.9; [L23] unsigned char var_1_2 = 0; [L24] unsigned char var_1_3 = 0; [L25] float var_1_4 = 31.5; [L26] float var_1_5 = 25.4; [L27] float var_1_6 = 9.5; [L28] float var_1_7 = 63.2; [L29] unsigned long int var_1_8 = 1; [L30] signed short int var_1_10 = -50; [L31] unsigned long int var_1_11 = 8; [L32] unsigned char var_1_12 = 32; [L33] float var_1_13 = 15.625; [L34] unsigned char var_1_14 = 1; [L35] unsigned char var_1_15 = 0; [L36] unsigned char var_1_16 = 1; [L37] unsigned char var_1_17 = 1; [L38] unsigned char var_1_19 = 0; [L39] unsigned char var_1_20 = 8; [L40] unsigned short int var_1_21 = 16; [L41] unsigned short int var_1_22 = 128; [L42] signed short int var_1_23 = 128; [L43] signed short int var_1_24 = -256; [L44] unsigned short int var_1_25 = 32; [L45] unsigned short int var_1_26 = 128; [L46] double var_1_27 = 25.5; [L47] double var_1_28 = 200.9; [L48] signed char var_1_29 = -10; [L49] signed char var_1_30 = -32; [L50] signed char var_1_31 = -5; [L51] unsigned char var_1_32 = 1; [L52] double var_1_33 = 199.5; [L53] unsigned long int var_1_34 = 4; VAL [isInitial=0, var_1_10=-50, var_1_11=8, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_24=-256, var_1_25=32, var_1_26=128, var_1_27=51/2, var_1_28=2009/10, var_1_29=-10, var_1_2=0, var_1_30=-32, var_1_31=-5, var_1_32=1, var_1_33=399/2, var_1_34=4, var_1_3=0, var_1_4=63/2, var_1_5=127/5, var_1_6=19/2, var_1_7=316/5, var_1_8=1] [L162] isInitial = 1 [L163] FCALL initially() [L164] COND TRUE 1 [L165] FCALL updateLastVariables() [L166] CALL updateVariables() [L108] var_1_2 = __VERIFIER_nondet_uchar() [L109] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=8, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_24=-256, var_1_25=32, var_1_26=128, var_1_27=51/2, var_1_28=2009/10, var_1_29=-10, var_1_30=-32, var_1_31=-5, var_1_32=1, var_1_33=399/2, var_1_34=4, var_1_3=0, var_1_4=63/2, var_1_5=127/5, var_1_6=19/2, var_1_7=316/5, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=8, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_24=-256, var_1_25=32, var_1_26=128, var_1_27=51/2, var_1_28=2009/10, var_1_29=-10, var_1_30=-32, var_1_31=-5, var_1_32=1, var_1_33=399/2, var_1_34=4, var_1_3=0, var_1_4=63/2, var_1_5=127/5, var_1_6=19/2, var_1_7=316/5, var_1_8=1] [L109] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, var_1_10=-50, var_1_11=8, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_24=-256, var_1_25=32, var_1_26=128, var_1_27=51/2, var_1_28=2009/10, var_1_29=-10, var_1_30=-32, var_1_31=-5, var_1_32=1, var_1_33=399/2, var_1_34=4, var_1_3=0, var_1_4=63/2, var_1_5=127/5, var_1_6=19/2, var_1_7=316/5, var_1_8=1] [L110] CALL assume_abort_if_not(var_1_2 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=8, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_24=-256, var_1_25=32, var_1_26=128, var_1_27=51/2, var_1_28=2009/10, var_1_29=-10, var_1_2=1, var_1_30=-32, var_1_31=-5, var_1_32=1, var_1_33=399/2, var_1_34=4, var_1_3=0, var_1_4=63/2, var_1_5=127/5, var_1_6=19/2, var_1_7=316/5, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=8, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_24=-256, var_1_25=32, var_1_26=128, var_1_27=51/2, var_1_28=2009/10, var_1_29=-10, var_1_2=1, var_1_30=-32, var_1_31=-5, var_1_32=1, var_1_33=399/2, var_1_34=4, var_1_3=0, var_1_4=63/2, var_1_5=127/5, var_1_6=19/2, var_1_7=316/5, var_1_8=1] [L110] RET assume_abort_if_not(var_1_2 <= 1) VAL [isInitial=1, var_1_10=-50, var_1_11=8, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_24=-256, var_1_25=32, var_1_26=128, var_1_27=51/2, var_1_28=2009/10, var_1_29=-10, var_1_2=1, var_1_30=-32, var_1_31=-5, var_1_32=1, var_1_33=399/2, var_1_34=4, var_1_3=0, var_1_4=63/2, var_1_5=127/5, var_1_6=19/2, var_1_7=316/5, var_1_8=1] [L111] var_1_3 = __VERIFIER_nondet_uchar() [L112] CALL assume_abort_if_not(var_1_3 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=8, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_24=-256, var_1_25=32, var_1_26=128, var_1_27=51/2, var_1_28=2009/10, var_1_29=-10, var_1_2=1, var_1_30=-32, var_1_31=-5, var_1_32=1, var_1_33=399/2, var_1_34=4, var_1_4=63/2, var_1_5=127/5, var_1_6=19/2, var_1_7=316/5, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=8, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_24=-256, var_1_25=32, var_1_26=128, var_1_27=51/2, var_1_28=2009/10, var_1_29=-10, var_1_2=1, var_1_30=-32, var_1_31=-5, var_1_32=1, var_1_33=399/2, var_1_34=4, var_1_4=63/2, var_1_5=127/5, var_1_6=19/2, var_1_7=316/5, var_1_8=1] [L112] RET assume_abort_if_not(var_1_3 >= 0) VAL [isInitial=1, var_1_10=-50, var_1_11=8, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_24=-256, var_1_25=32, var_1_26=128, var_1_27=51/2, var_1_28=2009/10, var_1_29=-10, var_1_2=1, var_1_30=-32, var_1_31=-5, var_1_32=1, var_1_33=399/2, var_1_34=4, var_1_4=63/2, var_1_5=127/5, var_1_6=19/2, var_1_7=316/5, var_1_8=1] [L113] CALL assume_abort_if_not(var_1_3 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=8, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_24=-256, var_1_25=32, var_1_26=128, var_1_27=51/2, var_1_28=2009/10, var_1_29=-10, var_1_2=1, var_1_30=-32, var_1_31=-5, var_1_32=1, var_1_33=399/2, var_1_34=4, var_1_3=1, var_1_4=63/2, var_1_5=127/5, var_1_6=19/2, var_1_7=316/5, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=8, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_24=-256, var_1_25=32, var_1_26=128, var_1_27=51/2, var_1_28=2009/10, var_1_29=-10, var_1_2=1, var_1_30=-32, var_1_31=-5, var_1_32=1, var_1_33=399/2, var_1_34=4, var_1_3=1, var_1_4=63/2, var_1_5=127/5, var_1_6=19/2, var_1_7=316/5, var_1_8=1] [L113] RET assume_abort_if_not(var_1_3 <= 1) VAL [isInitial=1, var_1_10=-50, var_1_11=8, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_24=-256, var_1_25=32, var_1_26=128, var_1_27=51/2, var_1_28=2009/10, var_1_29=-10, var_1_2=1, var_1_30=-32, var_1_31=-5, var_1_32=1, var_1_33=399/2, var_1_34=4, var_1_3=1, var_1_4=63/2, var_1_5=127/5, var_1_6=19/2, var_1_7=316/5, var_1_8=1] [L114] var_1_4 = __VERIFIER_nondet_float() [L115] CALL assume_abort_if_not((var_1_4 >= 0.0F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854765600e+12F && var_1_4 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=8, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_24=-256, var_1_25=32, var_1_26=128, var_1_27=51/2, var_1_28=2009/10, var_1_29=-10, var_1_2=1, var_1_30=-32, var_1_31=-5, var_1_32=1, var_1_33=399/2, var_1_34=4, var_1_3=1, var_1_5=127/5, var_1_6=19/2, var_1_7=316/5, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=8, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_24=-256, var_1_25=32, var_1_26=128, var_1_27=51/2, var_1_28=2009/10, var_1_29=-10, var_1_2=1, var_1_30=-32, var_1_31=-5, var_1_32=1, var_1_33=399/2, var_1_34=4, var_1_3=1, var_1_5=127/5, var_1_6=19/2, var_1_7=316/5, var_1_8=1] [L115] RET assume_abort_if_not((var_1_4 >= 0.0F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854765600e+12F && var_1_4 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=-50, var_1_11=8, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_24=-256, var_1_25=32, var_1_26=128, var_1_27=51/2, var_1_28=2009/10, var_1_29=-10, var_1_2=1, var_1_30=-32, var_1_31=-5, var_1_32=1, var_1_33=399/2, var_1_34=4, var_1_3=1, var_1_5=127/5, var_1_6=19/2, var_1_7=316/5, var_1_8=1] [L116] var_1_5 = __VERIFIER_nondet_float() [L117] CALL assume_abort_if_not((var_1_5 >= 0.0F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854765600e+12F && var_1_5 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=8, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_24=-256, var_1_25=32, var_1_26=128, var_1_27=51/2, var_1_28=2009/10, var_1_29=-10, var_1_2=1, var_1_30=-32, var_1_31=-5, var_1_32=1, var_1_33=399/2, var_1_34=4, var_1_3=1, var_1_6=19/2, var_1_7=316/5, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=8, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_24=-256, var_1_25=32, var_1_26=128, var_1_27=51/2, var_1_28=2009/10, var_1_29=-10, var_1_2=1, var_1_30=-32, var_1_31=-5, var_1_32=1, var_1_33=399/2, var_1_34=4, var_1_3=1, var_1_6=19/2, var_1_7=316/5, var_1_8=1] [L117] RET assume_abort_if_not((var_1_5 >= 0.0F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854765600e+12F && var_1_5 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=-50, var_1_11=8, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_24=-256, var_1_25=32, var_1_26=128, var_1_27=51/2, var_1_28=2009/10, var_1_29=-10, var_1_2=1, var_1_30=-32, var_1_31=-5, var_1_32=1, var_1_33=399/2, var_1_34=4, var_1_3=1, var_1_6=19/2, var_1_7=316/5, var_1_8=1] [L118] var_1_6 = __VERIFIER_nondet_float() [L119] CALL assume_abort_if_not((var_1_6 >= 0.0F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 9223372.036854765600e+12F && var_1_6 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=8, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_24=-256, var_1_25=32, var_1_26=128, var_1_27=51/2, var_1_28=2009/10, var_1_29=-10, var_1_2=1, var_1_30=-32, var_1_31=-5, var_1_32=1, var_1_33=399/2, var_1_34=4, var_1_3=1, var_1_7=316/5, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=8, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_24=-256, var_1_25=32, var_1_26=128, var_1_27=51/2, var_1_28=2009/10, var_1_29=-10, var_1_2=1, var_1_30=-32, var_1_31=-5, var_1_32=1, var_1_33=399/2, var_1_34=4, var_1_3=1, var_1_7=316/5, var_1_8=1] [L119] RET assume_abort_if_not((var_1_6 >= 0.0F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 9223372.036854765600e+12F && var_1_6 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=-50, var_1_11=8, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_24=-256, var_1_25=32, var_1_26=128, var_1_27=51/2, var_1_28=2009/10, var_1_29=-10, var_1_2=1, var_1_30=-32, var_1_31=-5, var_1_32=1, var_1_33=399/2, var_1_34=4, var_1_3=1, var_1_7=316/5, var_1_8=1] [L120] var_1_7 = __VERIFIER_nondet_float() [L121] CALL assume_abort_if_not((var_1_7 >= 0.0F && var_1_7 <= -1.0e-20F) || (var_1_7 <= 9223372.036854765600e+12F && var_1_7 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=8, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_24=-256, var_1_25=32, var_1_26=128, var_1_27=51/2, var_1_28=2009/10, var_1_29=-10, var_1_2=1, var_1_30=-32, var_1_31=-5, var_1_32=1, var_1_33=399/2, var_1_34=4, var_1_3=1, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=8, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_24=-256, var_1_25=32, var_1_26=128, var_1_27=51/2, var_1_28=2009/10, var_1_29=-10, var_1_2=1, var_1_30=-32, var_1_31=-5, var_1_32=1, var_1_33=399/2, var_1_34=4, var_1_3=1, var_1_8=1] [L121] RET assume_abort_if_not((var_1_7 >= 0.0F && var_1_7 <= -1.0e-20F) || (var_1_7 <= 9223372.036854765600e+12F && var_1_7 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=-50, var_1_11=8, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_24=-256, var_1_25=32, var_1_26=128, var_1_27=51/2, var_1_28=2009/10, var_1_29=-10, var_1_2=1, var_1_30=-32, var_1_31=-5, var_1_32=1, var_1_33=399/2, var_1_34=4, var_1_3=1, var_1_8=1] [L122] var_1_11 = __VERIFIER_nondet_ulong() [L123] CALL assume_abort_if_not(var_1_11 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_24=-256, var_1_25=32, var_1_26=128, var_1_27=51/2, var_1_28=2009/10, var_1_29=-10, var_1_2=1, var_1_30=-32, var_1_31=-5, var_1_32=1, var_1_33=399/2, var_1_34=4, var_1_3=1, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_24=-256, var_1_25=32, var_1_26=128, var_1_27=51/2, var_1_28=2009/10, var_1_29=-10, var_1_2=1, var_1_30=-32, var_1_31=-5, var_1_32=1, var_1_33=399/2, var_1_34=4, var_1_3=1, var_1_8=1] [L123] RET assume_abort_if_not(var_1_11 >= 0) VAL [isInitial=1, var_1_10=-50, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_24=-256, var_1_25=32, var_1_26=128, var_1_27=51/2, var_1_28=2009/10, var_1_29=-10, var_1_2=1, var_1_30=-32, var_1_31=-5, var_1_32=1, var_1_33=399/2, var_1_34=4, var_1_3=1, var_1_8=1] [L124] CALL assume_abort_if_not(var_1_11 <= 33) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=-4294967296, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_24=-256, var_1_25=32, var_1_26=128, var_1_27=51/2, var_1_28=2009/10, var_1_29=-10, var_1_2=1, var_1_30=-32, var_1_31=-5, var_1_32=1, var_1_33=399/2, var_1_34=4, var_1_3=1, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=-4294967296, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_24=-256, var_1_25=32, var_1_26=128, var_1_27=51/2, var_1_28=2009/10, var_1_29=-10, var_1_2=1, var_1_30=-32, var_1_31=-5, var_1_32=1, var_1_33=399/2, var_1_34=4, var_1_3=1, var_1_8=1] [L124] RET assume_abort_if_not(var_1_11 <= 33) VAL [isInitial=1, var_1_10=-50, var_1_11=-4294967296, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_24=-256, var_1_25=32, var_1_26=128, var_1_27=51/2, var_1_28=2009/10, var_1_29=-10, var_1_2=1, var_1_30=-32, var_1_31=-5, var_1_32=1, var_1_33=399/2, var_1_34=4, var_1_3=1, var_1_8=1] [L125] var_1_13 = __VERIFIER_nondet_float() [L126] CALL assume_abort_if_not((var_1_13 >= -922337.2036854776000e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854776000e+12F && var_1_13 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=-4294967296, var_1_12=32, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_24=-256, var_1_25=32, var_1_26=128, var_1_27=51/2, var_1_28=2009/10, var_1_29=-10, var_1_2=1, var_1_30=-32, var_1_31=-5, var_1_32=1, var_1_33=399/2, var_1_34=4, var_1_3=1, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=-4294967296, var_1_12=32, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_24=-256, var_1_25=32, var_1_26=128, var_1_27=51/2, var_1_28=2009/10, var_1_29=-10, var_1_2=1, var_1_30=-32, var_1_31=-5, var_1_32=1, var_1_33=399/2, var_1_34=4, var_1_3=1, var_1_8=1] [L126] RET assume_abort_if_not((var_1_13 >= -922337.2036854776000e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854776000e+12F && var_1_13 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=-50, var_1_11=-4294967296, var_1_12=32, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_24=-256, var_1_25=32, var_1_26=128, var_1_27=51/2, var_1_28=2009/10, var_1_29=-10, var_1_2=1, var_1_30=-32, var_1_31=-5, var_1_32=1, var_1_33=399/2, var_1_34=4, var_1_3=1, var_1_8=1] [L127] CALL assume_abort_if_not(var_1_13 != 0.0F) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=-4294967296, var_1_12=32, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_24=-256, var_1_25=32, var_1_26=128, var_1_27=51/2, var_1_28=2009/10, var_1_29=-10, var_1_2=1, var_1_30=-32, var_1_31=-5, var_1_32=1, var_1_33=399/2, var_1_34=4, var_1_3=1, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=-4294967296, var_1_12=32, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_24=-256, var_1_25=32, var_1_26=128, var_1_27=51/2, var_1_28=2009/10, var_1_29=-10, var_1_2=1, var_1_30=-32, var_1_31=-5, var_1_32=1, var_1_33=399/2, var_1_34=4, var_1_3=1, var_1_8=1] [L127] RET assume_abort_if_not(var_1_13 != 0.0F) VAL [isInitial=1, var_1_10=-50, var_1_11=-4294967296, var_1_12=32, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_24=-256, var_1_25=32, var_1_26=128, var_1_27=51/2, var_1_28=2009/10, var_1_29=-10, var_1_2=1, var_1_30=-32, var_1_31=-5, var_1_32=1, var_1_33=399/2, var_1_34=4, var_1_3=1, var_1_8=1] [L128] var_1_15 = __VERIFIER_nondet_uchar() [L129] CALL assume_abort_if_not(var_1_15 >= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=-4294967296, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_24=-256, var_1_25=32, var_1_26=128, var_1_27=51/2, var_1_28=2009/10, var_1_29=-10, var_1_2=1, var_1_30=-32, var_1_31=-5, var_1_32=1, var_1_33=399/2, var_1_34=4, var_1_3=1, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=-4294967296, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_24=-256, var_1_25=32, var_1_26=128, var_1_27=51/2, var_1_28=2009/10, var_1_29=-10, var_1_2=1, var_1_30=-32, var_1_31=-5, var_1_32=1, var_1_33=399/2, var_1_34=4, var_1_3=1, var_1_8=1] [L129] RET assume_abort_if_not(var_1_15 >= 1) VAL [isInitial=1, var_1_10=-50, var_1_11=-4294967296, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_24=-256, var_1_25=32, var_1_26=128, var_1_27=51/2, var_1_28=2009/10, var_1_29=-10, var_1_2=1, var_1_30=-32, var_1_31=-5, var_1_32=1, var_1_33=399/2, var_1_34=4, var_1_3=1, var_1_8=1] [L130] CALL assume_abort_if_not(var_1_15 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=-4294967296, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_24=-256, var_1_25=32, var_1_26=128, var_1_27=51/2, var_1_28=2009/10, var_1_29=-10, var_1_2=1, var_1_30=-32, var_1_31=-5, var_1_32=1, var_1_33=399/2, var_1_34=4, var_1_3=1, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=-4294967296, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_24=-256, var_1_25=32, var_1_26=128, var_1_27=51/2, var_1_28=2009/10, var_1_29=-10, var_1_2=1, var_1_30=-32, var_1_31=-5, var_1_32=1, var_1_33=399/2, var_1_34=4, var_1_3=1, var_1_8=1] [L130] RET assume_abort_if_not(var_1_15 <= 1) VAL [isInitial=1, var_1_10=-50, var_1_11=-4294967296, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_24=-256, var_1_25=32, var_1_26=128, var_1_27=51/2, var_1_28=2009/10, var_1_29=-10, var_1_2=1, var_1_30=-32, var_1_31=-5, var_1_32=1, var_1_33=399/2, var_1_34=4, var_1_3=1, var_1_8=1] [L131] var_1_16 = __VERIFIER_nondet_uchar() [L132] CALL assume_abort_if_not(var_1_16 >= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=-4294967296, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_24=-256, var_1_25=32, var_1_26=128, var_1_27=51/2, var_1_28=2009/10, var_1_29=-10, var_1_2=1, var_1_30=-32, var_1_31=-5, var_1_32=1, var_1_33=399/2, var_1_34=4, var_1_3=1, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=-4294967296, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_24=-256, var_1_25=32, var_1_26=128, var_1_27=51/2, var_1_28=2009/10, var_1_29=-10, var_1_2=1, var_1_30=-32, var_1_31=-5, var_1_32=1, var_1_33=399/2, var_1_34=4, var_1_3=1, var_1_8=1] [L132] RET assume_abort_if_not(var_1_16 >= 1) VAL [isInitial=1, var_1_10=-50, var_1_11=-4294967296, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_24=-256, var_1_25=32, var_1_26=128, var_1_27=51/2, var_1_28=2009/10, var_1_29=-10, var_1_2=1, var_1_30=-32, var_1_31=-5, var_1_32=1, var_1_33=399/2, var_1_34=4, var_1_3=1, var_1_8=1] [L133] CALL assume_abort_if_not(var_1_16 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=-4294967296, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_24=-256, var_1_25=32, var_1_26=128, var_1_27=51/2, var_1_28=2009/10, var_1_29=-10, var_1_2=1, var_1_30=-32, var_1_31=-5, var_1_32=1, var_1_33=399/2, var_1_34=4, var_1_3=1, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=-4294967296, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_24=-256, var_1_25=32, var_1_26=128, var_1_27=51/2, var_1_28=2009/10, var_1_29=-10, var_1_2=1, var_1_30=-32, var_1_31=-5, var_1_32=1, var_1_33=399/2, var_1_34=4, var_1_3=1, var_1_8=1] [L133] RET assume_abort_if_not(var_1_16 <= 1) VAL [isInitial=1, var_1_10=-50, var_1_11=-4294967296, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_24=-256, var_1_25=32, var_1_26=128, var_1_27=51/2, var_1_28=2009/10, var_1_29=-10, var_1_2=1, var_1_30=-32, var_1_31=-5, var_1_32=1, var_1_33=399/2, var_1_34=4, var_1_3=1, var_1_8=1] [L134] var_1_17 = __VERIFIER_nondet_uchar() [L135] CALL assume_abort_if_not(var_1_17 >= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=-4294967296, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_24=-256, var_1_25=32, var_1_26=128, var_1_27=51/2, var_1_28=2009/10, var_1_29=-10, var_1_2=1, var_1_30=-32, var_1_31=-5, var_1_32=1, var_1_33=399/2, var_1_34=4, var_1_3=1, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=-4294967296, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_24=-256, var_1_25=32, var_1_26=128, var_1_27=51/2, var_1_28=2009/10, var_1_29=-10, var_1_2=1, var_1_30=-32, var_1_31=-5, var_1_32=1, var_1_33=399/2, var_1_34=4, var_1_3=1, var_1_8=1] [L135] RET assume_abort_if_not(var_1_17 >= 1) VAL [isInitial=1, var_1_10=-50, var_1_11=-4294967296, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_24=-256, var_1_25=32, var_1_26=128, var_1_27=51/2, var_1_28=2009/10, var_1_29=-10, var_1_2=1, var_1_30=-32, var_1_31=-5, var_1_32=1, var_1_33=399/2, var_1_34=4, var_1_3=1, var_1_8=1] [L136] CALL assume_abort_if_not(var_1_17 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=-4294967296, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_24=-256, var_1_25=32, var_1_26=128, var_1_27=51/2, var_1_28=2009/10, var_1_29=-10, var_1_2=1, var_1_30=-32, var_1_31=-5, var_1_32=1, var_1_33=399/2, var_1_34=4, var_1_3=1, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=-4294967296, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_24=-256, var_1_25=32, var_1_26=128, var_1_27=51/2, var_1_28=2009/10, var_1_29=-10, var_1_2=1, var_1_30=-32, var_1_31=-5, var_1_32=1, var_1_33=399/2, var_1_34=4, var_1_3=1, var_1_8=1] [L136] RET assume_abort_if_not(var_1_17 <= 1) VAL [isInitial=1, var_1_10=-50, var_1_11=-4294967296, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_24=-256, var_1_25=32, var_1_26=128, var_1_27=51/2, var_1_28=2009/10, var_1_29=-10, var_1_2=1, var_1_30=-32, var_1_31=-5, var_1_32=1, var_1_33=399/2, var_1_34=4, var_1_3=1, var_1_8=1] [L137] var_1_19 = __VERIFIER_nondet_uchar() [L138] CALL assume_abort_if_not(var_1_19 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=-4294967296, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_24=-256, var_1_25=32, var_1_26=128, var_1_27=51/2, var_1_28=2009/10, var_1_29=-10, var_1_2=1, var_1_30=-32, var_1_31=-5, var_1_32=1, var_1_33=399/2, var_1_34=4, var_1_3=1, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=-4294967296, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_24=-256, var_1_25=32, var_1_26=128, var_1_27=51/2, var_1_28=2009/10, var_1_29=-10, var_1_2=1, var_1_30=-32, var_1_31=-5, var_1_32=1, var_1_33=399/2, var_1_34=4, var_1_3=1, var_1_8=1] [L138] RET assume_abort_if_not(var_1_19 >= 0) VAL [isInitial=1, var_1_10=-50, var_1_11=-4294967296, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_24=-256, var_1_25=32, var_1_26=128, var_1_27=51/2, var_1_28=2009/10, var_1_29=-10, var_1_2=1, var_1_30=-32, var_1_31=-5, var_1_32=1, var_1_33=399/2, var_1_34=4, var_1_3=1, var_1_8=1] [L139] CALL assume_abort_if_not(var_1_19 <= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=-4294967296, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_24=-256, var_1_25=32, var_1_26=128, var_1_27=51/2, var_1_28=2009/10, var_1_29=-10, var_1_2=1, var_1_30=-32, var_1_31=-5, var_1_32=1, var_1_33=399/2, var_1_34=4, var_1_3=1, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=-4294967296, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_24=-256, var_1_25=32, var_1_26=128, var_1_27=51/2, var_1_28=2009/10, var_1_29=-10, var_1_2=1, var_1_30=-32, var_1_31=-5, var_1_32=1, var_1_33=399/2, var_1_34=4, var_1_3=1, var_1_8=1] [L139] RET assume_abort_if_not(var_1_19 <= 0) VAL [isInitial=1, var_1_10=-50, var_1_11=-4294967296, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_24=-256, var_1_25=32, var_1_26=128, var_1_27=51/2, var_1_28=2009/10, var_1_29=-10, var_1_2=1, var_1_30=-32, var_1_31=-5, var_1_32=1, var_1_33=399/2, var_1_34=4, var_1_3=1, var_1_8=1] [L140] var_1_24 = __VERIFIER_nondet_short() [L141] CALL assume_abort_if_not(var_1_24 >= -32767) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=-4294967296, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_24=-32767, var_1_25=32, var_1_26=128, var_1_27=51/2, var_1_28=2009/10, var_1_29=-10, var_1_2=1, var_1_30=-32, var_1_31=-5, var_1_32=1, var_1_33=399/2, var_1_34=4, var_1_3=1, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=-4294967296, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_24=-32767, var_1_25=32, var_1_26=128, var_1_27=51/2, var_1_28=2009/10, var_1_29=-10, var_1_2=1, var_1_30=-32, var_1_31=-5, var_1_32=1, var_1_33=399/2, var_1_34=4, var_1_3=1, var_1_8=1] [L141] RET assume_abort_if_not(var_1_24 >= -32767) VAL [isInitial=1, var_1_10=-50, var_1_11=-4294967296, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_24=-32767, var_1_25=32, var_1_26=128, var_1_27=51/2, var_1_28=2009/10, var_1_29=-10, var_1_2=1, var_1_30=-32, var_1_31=-5, var_1_32=1, var_1_33=399/2, var_1_34=4, var_1_3=1, var_1_8=1] [L142] CALL assume_abort_if_not(var_1_24 <= 32766) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=-4294967296, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_24=-32767, var_1_25=32, var_1_26=128, var_1_27=51/2, var_1_28=2009/10, var_1_29=-10, var_1_2=1, var_1_30=-32, var_1_31=-5, var_1_32=1, var_1_33=399/2, var_1_34=4, var_1_3=1, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=-4294967296, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_24=-32767, var_1_25=32, var_1_26=128, var_1_27=51/2, var_1_28=2009/10, var_1_29=-10, var_1_2=1, var_1_30=-32, var_1_31=-5, var_1_32=1, var_1_33=399/2, var_1_34=4, var_1_3=1, var_1_8=1] [L142] RET assume_abort_if_not(var_1_24 <= 32766) VAL [isInitial=1, var_1_10=-50, var_1_11=-4294967296, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_24=-32767, var_1_25=32, var_1_26=128, var_1_27=51/2, var_1_28=2009/10, var_1_29=-10, var_1_2=1, var_1_30=-32, var_1_31=-5, var_1_32=1, var_1_33=399/2, var_1_34=4, var_1_3=1, var_1_8=1] [L143] var_1_26 = __VERIFIER_nondet_ushort() [L144] CALL assume_abort_if_not(var_1_26 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=-4294967296, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_24=-32767, var_1_25=32, var_1_27=51/2, var_1_28=2009/10, var_1_29=-10, var_1_2=1, var_1_30=-32, var_1_31=-5, var_1_32=1, var_1_33=399/2, var_1_34=4, var_1_3=1, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=-4294967296, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_24=-32767, var_1_25=32, var_1_27=51/2, var_1_28=2009/10, var_1_29=-10, var_1_2=1, var_1_30=-32, var_1_31=-5, var_1_32=1, var_1_33=399/2, var_1_34=4, var_1_3=1, var_1_8=1] [L144] RET assume_abort_if_not(var_1_26 >= 0) VAL [isInitial=1, var_1_10=-50, var_1_11=-4294967296, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_24=-32767, var_1_25=32, var_1_27=51/2, var_1_28=2009/10, var_1_29=-10, var_1_2=1, var_1_30=-32, var_1_31=-5, var_1_32=1, var_1_33=399/2, var_1_34=4, var_1_3=1, var_1_8=1] [L145] CALL assume_abort_if_not(var_1_26 <= 65534) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=-4294967296, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_24=-32767, var_1_25=32, var_1_26=65534, var_1_27=51/2, var_1_28=2009/10, var_1_29=-10, var_1_2=1, var_1_30=-32, var_1_31=-5, var_1_32=1, var_1_33=399/2, var_1_34=4, var_1_3=1, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=-4294967296, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_24=-32767, var_1_25=32, var_1_26=65534, var_1_27=51/2, var_1_28=2009/10, var_1_29=-10, var_1_2=1, var_1_30=-32, var_1_31=-5, var_1_32=1, var_1_33=399/2, var_1_34=4, var_1_3=1, var_1_8=1] [L145] RET assume_abort_if_not(var_1_26 <= 65534) VAL [isInitial=1, var_1_10=-50, var_1_11=-4294967296, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_24=-32767, var_1_25=32, var_1_26=65534, var_1_27=51/2, var_1_28=2009/10, var_1_29=-10, var_1_2=1, var_1_30=-32, var_1_31=-5, var_1_32=1, var_1_33=399/2, var_1_34=4, var_1_3=1, var_1_8=1] [L146] var_1_28 = __VERIFIER_nondet_double() [L147] CALL assume_abort_if_not((var_1_28 >= -922337.2036854765600e+13F && var_1_28 <= -1.0e-20F) || (var_1_28 <= 9223372.036854765600e+12F && var_1_28 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=-4294967296, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_24=-32767, var_1_25=32, var_1_26=65534, var_1_27=51/2, var_1_29=-10, var_1_2=1, var_1_30=-32, var_1_31=-5, var_1_32=1, var_1_33=399/2, var_1_34=4, var_1_3=1, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=-4294967296, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_24=-32767, var_1_25=32, var_1_26=65534, var_1_27=51/2, var_1_29=-10, var_1_2=1, var_1_30=-32, var_1_31=-5, var_1_32=1, var_1_33=399/2, var_1_34=4, var_1_3=1, var_1_8=1] [L147] RET assume_abort_if_not((var_1_28 >= -922337.2036854765600e+13F && var_1_28 <= -1.0e-20F) || (var_1_28 <= 9223372.036854765600e+12F && var_1_28 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=-50, var_1_11=-4294967296, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_24=-32767, var_1_25=32, var_1_26=65534, var_1_27=51/2, var_1_29=-10, var_1_2=1, var_1_30=-32, var_1_31=-5, var_1_32=1, var_1_33=399/2, var_1_34=4, var_1_3=1, var_1_8=1] [L148] var_1_30 = __VERIFIER_nondet_char() [L149] CALL assume_abort_if_not(var_1_30 >= -127) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=-4294967296, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_24=-32767, var_1_25=32, var_1_26=65534, var_1_27=51/2, var_1_29=-10, var_1_2=1, var_1_30=-127, var_1_31=-5, var_1_32=1, var_1_33=399/2, var_1_34=4, var_1_3=1, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=-4294967296, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_24=-32767, var_1_25=32, var_1_26=65534, var_1_27=51/2, var_1_29=-10, var_1_2=1, var_1_30=-127, var_1_31=-5, var_1_32=1, var_1_33=399/2, var_1_34=4, var_1_3=1, var_1_8=1] [L149] RET assume_abort_if_not(var_1_30 >= -127) VAL [isInitial=1, var_1_10=-50, var_1_11=-4294967296, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_24=-32767, var_1_25=32, var_1_26=65534, var_1_27=51/2, var_1_29=-10, var_1_2=1, var_1_30=-127, var_1_31=-5, var_1_32=1, var_1_33=399/2, var_1_34=4, var_1_3=1, var_1_8=1] [L150] CALL assume_abort_if_not(var_1_30 <= 126) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=-4294967296, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_24=-32767, var_1_25=32, var_1_26=65534, var_1_27=51/2, var_1_29=-10, var_1_2=1, var_1_30=-127, var_1_31=-5, var_1_32=1, var_1_33=399/2, var_1_34=4, var_1_3=1, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=-4294967296, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_24=-32767, var_1_25=32, var_1_26=65534, var_1_27=51/2, var_1_29=-10, var_1_2=1, var_1_30=-127, var_1_31=-5, var_1_32=1, var_1_33=399/2, var_1_34=4, var_1_3=1, var_1_8=1] [L150] RET assume_abort_if_not(var_1_30 <= 126) VAL [isInitial=1, var_1_10=-50, var_1_11=-4294967296, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_24=-32767, var_1_25=32, var_1_26=65534, var_1_27=51/2, var_1_29=-10, var_1_2=1, var_1_30=-127, var_1_31=-5, var_1_32=1, var_1_33=399/2, var_1_34=4, var_1_3=1, var_1_8=1] [L151] var_1_31 = __VERIFIER_nondet_char() [L152] CALL assume_abort_if_not(var_1_31 >= -127) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=-4294967296, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_24=-32767, var_1_25=32, var_1_26=65534, var_1_27=51/2, var_1_29=-10, var_1_2=1, var_1_30=-127, var_1_31=126, var_1_32=1, var_1_33=399/2, var_1_34=4, var_1_3=1, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=-4294967296, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_24=-32767, var_1_25=32, var_1_26=65534, var_1_27=51/2, var_1_29=-10, var_1_2=1, var_1_30=-127, var_1_31=126, var_1_32=1, var_1_33=399/2, var_1_34=4, var_1_3=1, var_1_8=1] [L152] RET assume_abort_if_not(var_1_31 >= -127) VAL [isInitial=1, var_1_10=-50, var_1_11=-4294967296, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_24=-32767, var_1_25=32, var_1_26=65534, var_1_27=51/2, var_1_29=-10, var_1_2=1, var_1_30=-127, var_1_31=126, var_1_32=1, var_1_33=399/2, var_1_34=4, var_1_3=1, var_1_8=1] [L153] CALL assume_abort_if_not(var_1_31 <= 126) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=-4294967296, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_24=-32767, var_1_25=32, var_1_26=65534, var_1_27=51/2, var_1_29=-10, var_1_2=1, var_1_30=-127, var_1_31=126, var_1_32=1, var_1_33=399/2, var_1_34=4, var_1_3=1, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=-4294967296, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_24=-32767, var_1_25=32, var_1_26=65534, var_1_27=51/2, var_1_29=-10, var_1_2=1, var_1_30=-127, var_1_31=126, var_1_32=1, var_1_33=399/2, var_1_34=4, var_1_3=1, var_1_8=1] [L153] RET assume_abort_if_not(var_1_31 <= 126) VAL [isInitial=1, var_1_10=-50, var_1_11=-4294967296, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_24=-32767, var_1_25=32, var_1_26=65534, var_1_27=51/2, var_1_29=-10, var_1_2=1, var_1_30=-127, var_1_31=126, var_1_32=1, var_1_33=399/2, var_1_34=4, var_1_3=1, var_1_8=1] [L166] RET updateVariables() [L167] CALL step() [L57] var_1_23 = var_1_24 [L58] var_1_25 = var_1_26 [L59] var_1_27 = var_1_28 [L60] var_1_29 = ((((((((10) > (var_1_30)) ? (10) : (var_1_30)))) < (((((var_1_31) > (-8)) ? (var_1_31) : (-8))))) ? (((((10) > (var_1_30)) ? (10) : (var_1_30)))) : (((((var_1_31) > (-8)) ? (var_1_31) : (-8)))))) [L61] var_1_32 = 1 [L62] var_1_33 = var_1_28 [L63] var_1_34 = var_1_26 VAL [isInitial=1, var_1_10=-50, var_1_11=-4294967296, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=-32767, var_1_24=-32767, var_1_25=65534, var_1_26=65534, var_1_27=65539, var_1_28=65539, var_1_29=10, var_1_2=1, var_1_30=-127, var_1_31=126, var_1_32=1, var_1_33=65539, var_1_34=65534, var_1_3=1, var_1_8=1] [L64] COND TRUE var_1_6 == (var_1_4 / var_1_13) [L65] var_1_12 = var_1_11 VAL [isInitial=1, var_1_10=-50, var_1_11=-4294967296, var_1_12=-4294967296, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=-32767, var_1_24=-32767, var_1_25=65534, var_1_26=65534, var_1_27=65539, var_1_28=65539, var_1_29=10, var_1_2=1, var_1_30=-127, var_1_31=126, var_1_32=1, var_1_33=65539, var_1_34=65534, var_1_3=1, var_1_8=1] [L67] var_1_20 = var_1_11 [L68] var_1_21 = 8 VAL [isInitial=1, var_1_10=-50, var_1_11=-4294967296, var_1_12=-4294967296, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=-4294967296, var_1_21=8, var_1_22=128, var_1_23=-32767, var_1_24=-32767, var_1_25=65534, var_1_26=65534, var_1_27=65539, var_1_28=65539, var_1_29=10, var_1_2=1, var_1_30=-127, var_1_31=126, var_1_32=1, var_1_33=65539, var_1_34=65534, var_1_3=1, var_1_8=1] [L69] EXPR 2u >> var_1_11 VAL [isInitial=1, var_1_10=-50, var_1_11=-4294967296, var_1_12=-4294967296, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=-4294967296, var_1_21=8, var_1_22=128, var_1_23=-32767, var_1_24=-32767, var_1_25=65534, var_1_26=65534, var_1_27=65539, var_1_28=65539, var_1_29=10, var_1_2=1, var_1_30=-127, var_1_31=126, var_1_32=1, var_1_33=65539, var_1_34=65534, var_1_3=1, var_1_8=1] [L69] COND TRUE (var_1_21 + var_1_12) > (2u >> var_1_11) [L70] COND TRUE var_1_12 != var_1_21 [L71] var_1_10 = var_1_11 VAL [isInitial=1, var_1_10=0, var_1_11=-4294967296, var_1_12=-4294967296, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=-4294967296, var_1_21=8, var_1_22=128, var_1_23=-32767, var_1_24=-32767, var_1_25=65534, var_1_26=65534, var_1_27=65539, var_1_28=65539, var_1_29=10, var_1_2=1, var_1_30=-127, var_1_31=126, var_1_32=1, var_1_33=65539, var_1_34=65534, var_1_3=1, var_1_8=1] [L76] COND FALSE !(! var_1_2) VAL [isInitial=1, var_1_10=0, var_1_11=-4294967296, var_1_12=-4294967296, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=-4294967296, var_1_21=8, var_1_22=128, var_1_23=-32767, var_1_24=-32767, var_1_25=65534, var_1_26=65534, var_1_27=65539, var_1_28=65539, var_1_29=10, var_1_2=1, var_1_30=-127, var_1_31=126, var_1_32=1, var_1_33=65539, var_1_34=65534, var_1_3=1, var_1_8=1] [L87] unsigned char stepLocal_1 = var_1_14; [L88] unsigned char stepLocal_0 = var_1_14; VAL [isInitial=1, stepLocal_0=1, stepLocal_1=1, var_1_10=0, var_1_11=-4294967296, var_1_12=-4294967296, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=-4294967296, var_1_21=8, var_1_22=128, var_1_23=-32767, var_1_24=-32767, var_1_25=65534, var_1_26=65534, var_1_27=65539, var_1_28=65539, var_1_29=10, var_1_2=1, var_1_30=-127, var_1_31=126, var_1_32=1, var_1_33=65539, var_1_34=65534, var_1_3=1, var_1_8=1] [L89] COND TRUE var_1_14 || stepLocal_0 VAL [isInitial=1, stepLocal_1=1, var_1_10=0, var_1_11=-4294967296, var_1_12=-4294967296, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=-4294967296, var_1_21=8, var_1_22=128, var_1_23=-32767, var_1_24=-32767, var_1_25=65534, var_1_26=65534, var_1_27=65539, var_1_28=65539, var_1_29=10, var_1_2=1, var_1_30=-127, var_1_31=126, var_1_32=1, var_1_33=65539, var_1_34=65534, var_1_3=1, var_1_8=1] [L90] COND TRUE stepLocal_1 || var_1_14 [L91] var_1_1 = (((((((((var_1_4) < (var_1_5)) ? (var_1_4) : (var_1_5)))) > (var_1_6)) ? (((((var_1_4) < (var_1_5)) ? (var_1_4) : (var_1_5)))) : (var_1_6))) - var_1_7) VAL [isInitial=1, var_1_10=0, var_1_11=-4294967296, var_1_12=-4294967296, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_20=-4294967296, var_1_21=8, var_1_22=128, var_1_23=-32767, var_1_24=-32767, var_1_25=65534, var_1_26=65534, var_1_27=65539, var_1_28=65539, var_1_29=10, var_1_2=1, var_1_30=-127, var_1_31=126, var_1_32=1, var_1_33=65539, var_1_34=65534, var_1_3=1, var_1_8=1] [L98] COND FALSE !(var_1_6 > (- var_1_7)) [L103] var_1_8 = var_1_20 VAL [isInitial=1, var_1_10=0, var_1_11=-4294967296, var_1_12=-4294967296, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_20=-4294967296, var_1_21=8, var_1_22=128, var_1_23=-32767, var_1_24=-32767, var_1_25=65534, var_1_26=65534, var_1_27=65539, var_1_28=65539, var_1_29=10, var_1_2=1, var_1_30=-127, var_1_31=126, var_1_32=1, var_1_33=65539, var_1_34=65534, var_1_3=1, var_1_8=0] [L105] var_1_22 = var_1_8 VAL [isInitial=1, var_1_10=0, var_1_11=-4294967296, var_1_12=-4294967296, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_20=-4294967296, var_1_21=8, var_1_22=0, var_1_23=-32767, var_1_24=-32767, var_1_25=65534, var_1_26=65534, var_1_27=65539, var_1_28=65539, var_1_29=10, var_1_2=1, var_1_30=-127, var_1_31=126, var_1_32=1, var_1_33=65539, var_1_34=65534, var_1_3=1, var_1_8=0] [L167] RET step() [L168] CALL, EXPR property() [L158] EXPR (((var_1_14 || var_1_14) ? ((var_1_14 || var_1_14) ? (var_1_1 == ((float) (((((((((var_1_4) < (var_1_5)) ? (var_1_4) : (var_1_5)))) > (var_1_6)) ? (((((var_1_4) < (var_1_5)) ? (var_1_4) : (var_1_5)))) : (var_1_6))) - var_1_7))) : (var_1_1 == ((float) 1.0000000075E8f))) : (var_1_1 == ((float) var_1_7))) && ((var_1_6 > (- var_1_7)) ? ((var_1_5 == (((((var_1_6 * var_1_7)) > (var_1_1)) ? ((var_1_6 * var_1_7)) : (var_1_1)))) ? (var_1_8 == ((unsigned long int) 8u)) : 1) : (var_1_8 == ((unsigned long int) var_1_20)))) && (((var_1_21 + var_1_12) > (2u >> var_1_11)) ? ((var_1_12 != var_1_21) ? (var_1_10 == ((signed short int) var_1_11)) : (var_1_10 == ((signed short int) 128))) : 1) VAL [isInitial=1, var_1_10=0, var_1_11=-4294967296, var_1_12=-4294967296, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_20=-4294967296, var_1_21=8, var_1_22=0, var_1_23=-32767, var_1_24=-32767, var_1_25=65534, var_1_26=65534, var_1_27=65539, var_1_28=65539, var_1_29=10, var_1_2=1, var_1_30=-127, var_1_31=126, var_1_32=1, var_1_33=65539, var_1_34=65534, var_1_3=1, var_1_8=0] [L158-L159] return ((((((((var_1_14 || var_1_14) ? ((var_1_14 || var_1_14) ? (var_1_1 == ((float) (((((((((var_1_4) < (var_1_5)) ? (var_1_4) : (var_1_5)))) > (var_1_6)) ? (((((var_1_4) < (var_1_5)) ? (var_1_4) : (var_1_5)))) : (var_1_6))) - var_1_7))) : (var_1_1 == ((float) 1.0000000075E8f))) : (var_1_1 == ((float) var_1_7))) && ((var_1_6 > (- var_1_7)) ? ((var_1_5 == (((((var_1_6 * var_1_7)) > (var_1_1)) ? ((var_1_6 * var_1_7)) : (var_1_1)))) ? (var_1_8 == ((unsigned long int) 8u)) : 1) : (var_1_8 == ((unsigned long int) var_1_20)))) && (((var_1_21 + var_1_12) > (2u >> var_1_11)) ? ((var_1_12 != var_1_21) ? (var_1_10 == ((signed short int) var_1_11)) : (var_1_10 == ((signed short int) 128))) : 1)) && ((var_1_6 == (var_1_4 / var_1_13)) ? (var_1_12 == ((unsigned char) var_1_11)) : 1)) && ((! var_1_2) ? ((var_1_2 || var_1_3) ? (var_1_14 == ((unsigned char) ((! (! var_1_15)) && (var_1_16 && var_1_17)))) : ((((((var_1_12) > (var_1_12)) ? (var_1_12) : (var_1_12))) >= var_1_21) ? (var_1_14 == ((unsigned char) (var_1_2 || var_1_16))) : (var_1_14 == ((unsigned char) (! var_1_19))))) : 1)) && (var_1_20 == ((unsigned char) var_1_11))) && (var_1_21 == ((unsigned short int) 8))) && (var_1_22 == ((unsigned short int) var_1_8)) ; [L168] RET, EXPR property() [L168] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_10=0, var_1_11=-4294967296, var_1_12=-4294967296, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_20=-4294967296, var_1_21=8, var_1_22=0, var_1_23=-32767, var_1_24=-32767, var_1_25=65534, var_1_26=65534, var_1_27=65539, var_1_28=65539, var_1_29=10, var_1_2=1, var_1_30=-127, var_1_31=126, var_1_32=1, var_1_33=65539, var_1_34=65534, var_1_3=1, var_1_8=0] [L19] reach_error() VAL [isInitial=1, var_1_10=0, var_1_11=-4294967296, var_1_12=-4294967296, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_20=-4294967296, var_1_21=8, var_1_22=0, var_1_23=-32767, var_1_24=-32767, var_1_25=65534, var_1_26=65534, var_1_27=65539, var_1_28=65539, var_1_29=10, var_1_2=1, var_1_30=-127, var_1_31=126, var_1_32=1, var_1_33=65539, var_1_34=65534, var_1_3=1, var_1_8=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 85 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 2.8s, OverallIterations: 4, TraceHistogramMax: 29, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 180 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 180 mSDsluCounter, 512 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 159 mSDsCounter, 2 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 94 IncrementalHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2 mSolverCounterUnsat, 353 mSDtfsCounter, 94 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 213 GetRequests, 210 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=157occurred in iteration=3, InterpolantAutomatonStates: 9, 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, 3 MinimizatonAttempts, 4 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 731 NumberOfCodeBlocks, 731 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 544 ConstructedInterpolants, 0 QuantifiedInterpolants, 677 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 3 InterpolantComputations, 3 PerfectInterpolantSequences, 4872/4872 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 [2024-11-08 20:17:26,994 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-27.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash b2a57ed806019e2a314732595f6a56c6ec2b2df5289c00e3d1fce673fb6d9182 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-08 20:17:29,254 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 20:17:29,324 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-08 20:17:29,331 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 20:17:29,332 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 20:17:29,372 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 20:17:29,374 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 20:17:29,374 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 20:17:29,375 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 20:17:29,376 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 20:17:29,377 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 20:17:29,377 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 20:17:29,378 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 20:17:29,381 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 20:17:29,381 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 20:17:29,382 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 20:17:29,382 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 20:17:29,382 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 20:17:29,382 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 20:17:29,382 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 20:17:29,383 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 20:17:29,383 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 20:17:29,383 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 20:17:29,384 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-08 20:17:29,384 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-08 20:17:29,384 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 20:17:29,384 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-08 20:17:29,384 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 20:17:29,385 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 20:17:29,385 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 20:17:29,385 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 20:17:29,385 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 20:17:29,385 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 20:17:29,386 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 20:17:29,386 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 20:17:29,386 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 20:17:29,386 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 20:17:29,387 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 20:17:29,387 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-08 20:17:29,387 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-08 20:17:29,388 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 20:17:29,389 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 20:17:29,389 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 20:17:29,389 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 20:17:29,390 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: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> b2a57ed806019e2a314732595f6a56c6ec2b2df5289c00e3d1fce673fb6d9182 [2024-11-08 20:17:29,734 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 20:17:29,761 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 20:17:29,764 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 20:17:29,765 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 20:17:29,767 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 20:17:29,768 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-27.i [2024-11-08 20:17:31,342 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 20:17:31,555 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 20:17:31,557 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-27.i [2024-11-08 20:17:31,567 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/94ecaf48a/0d2725d4165d47669ad484ec13f0254b/FLAGec2321801 [2024-11-08 20:17:31,580 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/94ecaf48a/0d2725d4165d47669ad484ec13f0254b [2024-11-08 20:17:31,582 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 20:17:31,584 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 20:17:31,585 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 20:17:31,585 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 20:17:31,590 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 20:17:31,591 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 08:17:31" (1/1) ... [2024-11-08 20:17:31,592 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2df899fa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:17:31, skipping insertion in model container [2024-11-08 20:17:31,593 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 08:17:31" (1/1) ... [2024-11-08 20:17:31,626 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 20:17:31,815 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-27.i[915,928] [2024-11-08 20:17:31,912 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 20:17:31,937 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 20:17:31,949 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-27.i[915,928] [2024-11-08 20:17:31,994 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 20:17:32,019 INFO L204 MainTranslator]: Completed translation [2024-11-08 20:17:32,020 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:17:32 WrapperNode [2024-11-08 20:17:32,020 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 20:17:32,021 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 20:17:32,021 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 20:17:32,021 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 20:17:32,028 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:17:32" (1/1) ... [2024-11-08 20:17:32,046 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:17:32" (1/1) ... [2024-11-08 20:17:32,085 INFO L138 Inliner]: procedures = 27, calls = 42, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 179 [2024-11-08 20:17:32,085 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 20:17:32,088 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 20:17:32,088 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 20:17:32,088 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 20:17:32,099 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:17:32" (1/1) ... [2024-11-08 20:17:32,099 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:17:32" (1/1) ... [2024-11-08 20:17:32,106 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:17:32" (1/1) ... [2024-11-08 20:17:32,126 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]. [2024-11-08 20:17:32,126 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:17:32" (1/1) ... [2024-11-08 20:17:32,127 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:17:32" (1/1) ... [2024-11-08 20:17:32,143 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:17:32" (1/1) ... [2024-11-08 20:17:32,147 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:17:32" (1/1) ... [2024-11-08 20:17:32,155 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:17:32" (1/1) ... [2024-11-08 20:17:32,160 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:17:32" (1/1) ... [2024-11-08 20:17:32,167 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 20:17:32,168 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 20:17:32,168 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 20:17:32,168 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 20:17:32,169 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:17:32" (1/1) ... [2024-11-08 20:17:32,180 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 20:17:32,191 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 20:17:32,206 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) [2024-11-08 20:17:32,213 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 [2024-11-08 20:17:32,252 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 20:17:32,252 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-08 20:17:32,252 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-08 20:17:32,252 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-08 20:17:32,252 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 20:17:32,253 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 20:17:32,348 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 20:17:32,351 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 20:17:37,146 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2024-11-08 20:17:37,146 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 20:17:37,160 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 20:17:37,160 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 20:17:37,161 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 08:17:37 BoogieIcfgContainer [2024-11-08 20:17:37,161 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 20:17:37,165 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 20:17:37,165 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 20:17:37,169 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 20:17:37,170 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 08:17:31" (1/3) ... [2024-11-08 20:17:37,170 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@248e5b31 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 08:17:37, skipping insertion in model container [2024-11-08 20:17:37,171 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:17:32" (2/3) ... [2024-11-08 20:17:37,172 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@248e5b31 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 08:17:37, skipping insertion in model container [2024-11-08 20:17:37,172 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 08:17:37" (3/3) ... [2024-11-08 20:17:37,174 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-10_file-27.i [2024-11-08 20:17:37,192 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 20:17:37,193 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 20:17:37,268 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 20:17:37,279 INFO L333 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, 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;@67c6b592, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 20:17:37,281 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 20:17:37,286 INFO L276 IsEmpty]: Start isEmpty. Operand has 78 states, 46 states have (on average 1.326086956521739) internal successors, (61), 47 states have internal predecessors, (61), 29 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2024-11-08 20:17:37,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2024-11-08 20:17:37,305 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 20:17:37,306 INFO L215 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 20:17:37,307 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 20:17:37,312 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 20:17:37,313 INFO L85 PathProgramCache]: Analyzing trace with hash 1018441539, now seen corresponding path program 1 times [2024-11-08 20:17:37,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 20:17:37,330 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [593650792] [2024-11-08 20:17:37,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 20:17:37,330 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 20:17:37,331 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 20:17:37,334 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 20:17:37,336 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-08 20:17:37,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:17:37,851 INFO L255 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-08 20:17:37,863 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 20:17:37,927 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 516 proven. 0 refuted. 0 times theorem prover too weak. 1108 trivial. 0 not checked. [2024-11-08 20:17:37,928 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 20:17:37,932 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 20:17:37,932 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [593650792] [2024-11-08 20:17:37,933 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [593650792] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 20:17:37,933 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 20:17:37,933 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 20:17:37,935 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1675728548] [2024-11-08 20:17:37,937 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 20:17:37,944 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-08 20:17:37,944 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 20:17:37,975 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-08 20:17:37,976 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 20:17:37,978 INFO L87 Difference]: Start difference. First operand has 78 states, 46 states have (on average 1.326086956521739) internal successors, (61), 47 states have internal predecessors, (61), 29 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) Second operand has 2 states, 2 states have (on average 20.5) internal successors, (41), 2 states have internal predecessors, (41), 2 states have call successors, (29), 2 states have call predecessors, (29), 2 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) [2024-11-08 20:17:38,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 20:17:38,011 INFO L93 Difference]: Finished difference Result 149 states and 261 transitions. [2024-11-08 20:17:38,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 20:17:38,014 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 20.5) internal successors, (41), 2 states have internal predecessors, (41), 2 states have call successors, (29), 2 states have call predecessors, (29), 2 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) Word has length 179 [2024-11-08 20:17:38,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 20:17:38,023 INFO L225 Difference]: With dead ends: 149 [2024-11-08 20:17:38,023 INFO L226 Difference]: Without dead ends: 74 [2024-11-08 20:17:38,027 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 178 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 20:17:38,030 INFO L432 NwaCegarLoop]: 112 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 112 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 20:17:38,031 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 20:17:38,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2024-11-08 20:17:38,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2024-11-08 20:17:38,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 43 states have (on average 1.255813953488372) internal successors, (54), 43 states have internal predecessors, (54), 29 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2024-11-08 20:17:38,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 112 transitions. [2024-11-08 20:17:38,092 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 112 transitions. Word has length 179 [2024-11-08 20:17:38,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 20:17:38,093 INFO L471 AbstractCegarLoop]: Abstraction has 74 states and 112 transitions. [2024-11-08 20:17:38,093 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 20.5) internal successors, (41), 2 states have internal predecessors, (41), 2 states have call successors, (29), 2 states have call predecessors, (29), 2 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) [2024-11-08 20:17:38,093 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 112 transitions. [2024-11-08 20:17:38,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2024-11-08 20:17:38,097 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 20:17:38,097 INFO L215 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 20:17:38,110 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-08 20:17:38,298 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 20:17:38,299 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 20:17:38,299 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 20:17:38,299 INFO L85 PathProgramCache]: Analyzing trace with hash -1418292103, now seen corresponding path program 1 times [2024-11-08 20:17:38,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 20:17:38,301 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [934967978] [2024-11-08 20:17:38,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 20:17:38,301 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 20:17:38,301 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 20:17:38,303 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 20:17:38,304 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-08 20:17:38,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:17:38,796 INFO L255 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-08 20:17:38,803 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 20:17:40,170 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 730 proven. 57 refuted. 0 times theorem prover too weak. 837 trivial. 0 not checked. [2024-11-08 20:17:40,174 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 20:17:40,755 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2024-11-08 20:17:40,755 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 20:17:40,756 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [934967978] [2024-11-08 20:17:40,756 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [934967978] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-08 20:17:40,756 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-08 20:17:40,756 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2024-11-08 20:17:40,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [269532603] [2024-11-08 20:17:40,756 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 20:17:40,758 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 20:17:40,758 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 20:17:40,759 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 20:17:40,759 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-08 20:17:40,760 INFO L87 Difference]: Start difference. First operand 74 states and 112 transitions. Second operand has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2024-11-08 20:17:44,174 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.19s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 20:17:44,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 20:17:44,180 INFO L93 Difference]: Finished difference Result 149 states and 224 transitions. [2024-11-08 20:17:44,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 20:17:44,209 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) Word has length 179 [2024-11-08 20:17:44,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 20:17:44,212 INFO L225 Difference]: With dead ends: 149 [2024-11-08 20:17:44,212 INFO L226 Difference]: Without dead ends: 78 [2024-11-08 20:17:44,213 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 356 GetRequests, 350 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-08 20:17:44,214 INFO L432 NwaCegarLoop]: 105 mSDtfsCounter, 53 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 160 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2024-11-08 20:17:44,215 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 160 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 3.4s Time] [2024-11-08 20:17:44,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2024-11-08 20:17:44,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2024-11-08 20:17:44,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 46 states have (on average 1.2173913043478262) internal successors, (56), 46 states have internal predecessors, (56), 29 states have call successors, (29), 2 states have call predecessors, (29), 2 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2024-11-08 20:17:44,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 114 transitions. [2024-11-08 20:17:44,230 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 114 transitions. Word has length 179 [2024-11-08 20:17:44,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 20:17:44,231 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 114 transitions. [2024-11-08 20:17:44,232 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2024-11-08 20:17:44,232 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 114 transitions. [2024-11-08 20:17:44,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2024-11-08 20:17:44,235 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 20:17:44,235 INFO L215 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 20:17:44,250 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2024-11-08 20:17:44,435 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 20:17:44,436 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 20:17:44,436 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 20:17:44,436 INFO L85 PathProgramCache]: Analyzing trace with hash 6243672, now seen corresponding path program 1 times [2024-11-08 20:17:44,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 20:17:44,437 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1142408485] [2024-11-08 20:17:44,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 20:17:44,437 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 20:17:44,438 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 20:17:44,439 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 20:17:44,441 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-08 20:17:44,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:17:44,861 INFO L255 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-08 20:17:44,867 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 20:17:46,354 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2024-11-08 20:17:46,355 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 20:17:46,355 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 20:17:46,355 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1142408485] [2024-11-08 20:17:46,355 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1142408485] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 20:17:46,355 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 20:17:46,355 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 20:17:46,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [478322782] [2024-11-08 20:17:46,367 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 20:17:46,367 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 20:17:46,367 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 20:17:46,368 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 20:17:46,368 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 20:17:46,369 INFO L87 Difference]: Start difference. First operand 78 states and 114 transitions. Second operand has 4 states, 4 states have (on average 9.5) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2024-11-08 20:17:48,904 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.16s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 20:17:49,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 20:17:49,003 INFO L93 Difference]: Finished difference Result 228 states and 336 transitions. [2024-11-08 20:17:49,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 20:17:49,036 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) Word has length 180 [2024-11-08 20:17:49,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 20:17:49,038 INFO L225 Difference]: With dead ends: 228 [2024-11-08 20:17:49,038 INFO L226 Difference]: Without dead ends: 153 [2024-11-08 20:17:49,039 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 180 GetRequests, 177 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-08 20:17:49,040 INFO L432 NwaCegarLoop]: 107 mSDtfsCounter, 18 mSDsluCounter, 204 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 311 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2024-11-08 20:17:49,041 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 311 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2024-11-08 20:17:49,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2024-11-08 20:17:49,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 149. [2024-11-08 20:17:49,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149 states, 86 states have (on average 1.186046511627907) internal successors, (102), 86 states have internal predecessors, (102), 58 states have call successors, (58), 4 states have call predecessors, (58), 4 states have return successors, (58), 58 states have call predecessors, (58), 58 states have call successors, (58) [2024-11-08 20:17:49,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 218 transitions. [2024-11-08 20:17:49,069 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 218 transitions. Word has length 180 [2024-11-08 20:17:49,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 20:17:49,070 INFO L471 AbstractCegarLoop]: Abstraction has 149 states and 218 transitions. [2024-11-08 20:17:49,070 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2024-11-08 20:17:49,071 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 218 transitions. [2024-11-08 20:17:49,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2024-11-08 20:17:49,073 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 20:17:49,073 INFO L215 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 20:17:49,090 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2024-11-08 20:17:49,274 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 20:17:49,275 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 20:17:49,275 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 20:17:49,276 INFO L85 PathProgramCache]: Analyzing trace with hash 1169111909, now seen corresponding path program 1 times [2024-11-08 20:17:49,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 20:17:49,276 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [758070654] [2024-11-08 20:17:49,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 20:17:49,277 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 20:17:49,277 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 20:17:49,280 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 20:17:49,280 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-08 20:17:49,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:17:49,673 INFO L255 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-08 20:17:49,678 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 20:17:54,628 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 46 proven. 672 refuted. 0 times theorem prover too weak. 906 trivial. 0 not checked. [2024-11-08 20:17:54,629 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 20:17:55,397 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 20:17:55,397 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [758070654] [2024-11-08 20:17:55,398 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [758070654] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 20:17:55,398 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1578476215] [2024-11-08 20:17:55,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 20:17:55,398 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-08 20:17:55,399 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-08 20:17:55,401 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-08 20:17:55,402 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (6)] Waiting until timeout for monitored process [2024-11-08 20:17:56,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:17:56,489 INFO L255 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 33 conjuncts are in the unsatisfiable core [2024-11-08 20:17:56,499 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 20:18:41,187 WARN L286 SmtUtils]: Spent 10.27s on a formula simplification that was a NOOP. DAG size: 28 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)