./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/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 61a67961 Calling Ultimate with: /root/.sdkman/candidates/java/current/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 /storage/repos/ultimate/releaseScripts/default/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-wip.fs.cvc5-61a6796-m [2024-10-14 08:12:02,582 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 08:12:02,635 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-14 08:12:02,640 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 08:12:02,641 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 08:12:02,659 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 08:12:02,660 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 08:12:02,660 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 08:12:02,661 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 08:12:02,661 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 08:12:02,662 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 08:12:02,662 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 08:12:02,662 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 08:12:02,662 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 08:12:02,663 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 08:12:02,663 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 08:12:02,665 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 08:12:02,665 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 08:12:02,665 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-14 08:12:02,667 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 08:12:02,667 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 08:12:02,668 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 08:12:02,668 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 08:12:02,668 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 08:12:02,668 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 08:12:02,668 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 08:12:02,668 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 08:12:02,669 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 08:12:02,669 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 08:12:02,669 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 08:12:02,669 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 08:12:02,669 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 08:12:02,669 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 08:12:02,669 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 08:12:02,670 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 08:12:02,670 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-14 08:12:02,670 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-14 08:12:02,670 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-14 08:12:02,670 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 08:12:02,670 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 08:12:02,670 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 08:12:02,672 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 08:12:02,672 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-10-14 08:12:02,898 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 08:12:02,919 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 08:12:02,922 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 08:12:02,923 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 08:12:02,923 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 08:12:02,924 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-27.i [2024-10-14 08:12:04,160 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 08:12:04,348 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 08:12:04,349 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-27.i [2024-10-14 08:12:04,362 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/be185ca3c/a1adbe2a487b42499529621407e4c6ba/FLAG9c48ed060 [2024-10-14 08:12:04,732 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/be185ca3c/a1adbe2a487b42499529621407e4c6ba [2024-10-14 08:12:04,735 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 08:12:04,736 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 08:12:04,738 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 08:12:04,738 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 08:12:04,744 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 08:12:04,745 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 08:12:04" (1/1) ... [2024-10-14 08:12:04,748 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7b6bb3aa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:12:04, skipping insertion in model container [2024-10-14 08:12:04,748 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 08:12:04" (1/1) ... [2024-10-14 08:12:04,777 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 08:12:04,914 WARN L248 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-10-14 08:12:05,023 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 08:12:05,046 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 08:12:05,078 WARN L248 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-10-14 08:12:05,107 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 08:12:05,129 INFO L204 MainTranslator]: Completed translation [2024-10-14 08:12:05,129 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:12:05 WrapperNode [2024-10-14 08:12:05,130 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 08:12:05,131 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 08:12:05,131 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 08:12:05,131 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 08:12:05,137 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:12:05" (1/1) ... [2024-10-14 08:12:05,151 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:12:05" (1/1) ... [2024-10-14 08:12:05,188 INFO L138 Inliner]: procedures = 26, calls = 42, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 201 [2024-10-14 08:12:05,191 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 08:12:05,191 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 08:12:05,192 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 08:12:05,192 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 08:12:05,201 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:12:05" (1/1) ... [2024-10-14 08:12:05,201 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:12:05" (1/1) ... [2024-10-14 08:12:05,207 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:12:05" (1/1) ... [2024-10-14 08:12:05,227 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-10-14 08:12:05,228 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:12:05" (1/1) ... [2024-10-14 08:12:05,228 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:12:05" (1/1) ... [2024-10-14 08:12:05,234 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:12:05" (1/1) ... [2024-10-14 08:12:05,240 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:12:05" (1/1) ... [2024-10-14 08:12:05,242 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:12:05" (1/1) ... [2024-10-14 08:12:05,243 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:12:05" (1/1) ... [2024-10-14 08:12:05,245 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 08:12:05,246 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 08:12:05,246 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 08:12:05,246 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 08:12:05,247 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:12:05" (1/1) ... [2024-10-14 08:12:05,251 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 08:12:05,261 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 08:12:05,282 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-10-14 08:12:05,285 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-10-14 08:12:05,325 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 08:12:05,325 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-14 08:12:05,326 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-14 08:12:05,326 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-14 08:12:05,326 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 08:12:05,326 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 08:12:05,406 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 08:12:05,408 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 08:12:05,700 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2024-10-14 08:12:05,700 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 08:12:05,732 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 08:12:05,732 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-14 08:12:05,733 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 08:12:05 BoogieIcfgContainer [2024-10-14 08:12:05,733 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 08:12:05,734 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 08:12:05,735 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 08:12:05,737 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 08:12:05,737 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 08:12:04" (1/3) ... [2024-10-14 08:12:05,739 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ec3d981 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 08:12:05, skipping insertion in model container [2024-10-14 08:12:05,740 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:12:05" (2/3) ... [2024-10-14 08:12:05,740 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ec3d981 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 08:12:05, skipping insertion in model container [2024-10-14 08:12:05,741 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 08:12:05" (3/3) ... [2024-10-14 08:12:05,742 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-10_file-27.i [2024-10-14 08:12:05,757 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 08:12:05,758 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-14 08:12:05,822 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 08:12:05,827 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;@7e239598, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 08:12:05,828 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-14 08:12:05,832 INFO L276 IsEmpty]: Start isEmpty. Operand has 78 states, 46 states have (on average 1.391304347826087) internal successors, (64), 47 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-10-14 08:12:05,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2024-10-14 08:12:05,847 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 08:12:05,848 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] [2024-10-14 08:12:05,848 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 08:12:05,853 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 08:12:05,854 INFO L85 PathProgramCache]: Analyzing trace with hash 804510340, now seen corresponding path program 1 times [2024-10-14 08:12:05,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 08:12:05,862 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1936543931] [2024-10-14 08:12:05,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 08:12:05,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 08:12:05,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:12:06,117 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 08:12:06,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:12:06,126 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 08:12:06,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:12:06,133 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 08:12:06,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:12:06,138 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 08:12:06,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:12:06,142 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 08:12:06,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:12:06,146 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-14 08:12:06,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:12:06,151 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-14 08:12:06,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:12:06,155 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-14 08:12:06,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:12:06,163 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-14 08:12:06,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:12:06,168 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-14 08:12:06,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:12:06,177 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-14 08:12:06,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:12:06,181 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-14 08:12:06,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:12:06,185 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-14 08:12:06,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:12:06,188 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-14 08:12:06,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:12:06,192 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-14 08:12:06,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:12:06,196 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-14 08:12:06,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:12:06,201 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-14 08:12:06,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:12:06,205 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-14 08:12:06,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:12:06,209 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-10-14 08:12:06,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:12:06,212 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-14 08:12:06,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:12:06,217 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-10-14 08:12:06,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:12:06,222 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-14 08:12:06,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:12:06,228 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-14 08:12:06,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:12:06,233 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-14 08:12:06,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:12:06,240 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-10-14 08:12:06,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:12:06,254 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-10-14 08:12:06,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:12:06,264 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-10-14 08:12:06,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:12:06,270 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-10-14 08:12:06,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:12:06,276 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-14 08:12:06,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:12:06,286 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2024-10-14 08:12:06,286 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 08:12:06,287 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1936543931] [2024-10-14 08:12:06,287 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1936543931] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 08:12:06,288 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 08:12:06,288 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 08:12:06,290 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2129321308] [2024-10-14 08:12:06,290 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 08:12:06,294 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-14 08:12:06,294 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 08:12:06,318 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-14 08:12:06,319 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-14 08:12:06,321 INFO L87 Difference]: Start difference. First operand has 78 states, 46 states have (on average 1.391304347826087) internal successors, (64), 47 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) Second operand has 2 states, 2 states have (on average 17.5) internal successors, (35), 2 states have internal predecessors, (35), 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-10-14 08:12:06,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 08:12:06,363 INFO L93 Difference]: Finished difference Result 153 states and 271 transitions. [2024-10-14 08:12:06,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-14 08:12:06,367 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 17.5) internal successors, (35), 2 states have internal predecessors, (35), 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 177 [2024-10-14 08:12:06,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 08:12:06,372 INFO L225 Difference]: With dead ends: 153 [2024-10-14 08:12:06,373 INFO L226 Difference]: Without dead ends: 76 [2024-10-14 08:12:06,376 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-10-14 08:12:06,378 INFO L432 NwaCegarLoop]: 113 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 08:12:06,379 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 113 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 08:12:06,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2024-10-14 08:12:06,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2024-10-14 08:12:06,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 45 states have (on average 1.3111111111111111) internal successors, (59), 45 states have internal predecessors, (59), 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-10-14 08:12:06,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 117 transitions. [2024-10-14 08:12:06,436 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 117 transitions. Word has length 177 [2024-10-14 08:12:06,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 08:12:06,436 INFO L471 AbstractCegarLoop]: Abstraction has 76 states and 117 transitions. [2024-10-14 08:12:06,437 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 17.5) internal successors, (35), 2 states have internal predecessors, (35), 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-10-14 08:12:06,437 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 117 transitions. [2024-10-14 08:12:06,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2024-10-14 08:12:06,442 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 08:12:06,443 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] [2024-10-14 08:12:06,443 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-14 08:12:06,443 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 08:12:06,444 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 08:12:06,444 INFO L85 PathProgramCache]: Analyzing trace with hash -1719788530, now seen corresponding path program 1 times [2024-10-14 08:12:06,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 08:12:06,444 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1187735501] [2024-10-14 08:12:06,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 08:12:06,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 08:12:06,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:12:06,815 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 08:12:06,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:12:06,823 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 08:12:06,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:12:06,829 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 08:12:06,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:12:06,838 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 08:12:06,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:12:06,848 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 08:12:06,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:12:06,853 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-14 08:12:06,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:12:06,857 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-14 08:12:06,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:12:06,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-14 08:12:06,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:12:06,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-14 08:12:06,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:12:06,871 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-14 08:12:06,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:12:06,877 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-14 08:12:06,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:12:06,882 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-14 08:12:06,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:12:06,888 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-14 08:12:06,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:12:06,894 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-14 08:12:06,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:12:06,900 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-14 08:12:06,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:12:06,910 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-14 08:12:06,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:12:06,916 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-14 08:12:06,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:12:06,921 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-14 08:12:06,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:12:06,929 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-10-14 08:12:06,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:12:06,933 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-14 08:12:06,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:12:06,937 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-10-14 08:12:06,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:12:06,941 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-14 08:12:06,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:12:06,948 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-14 08:12:06,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:12:06,951 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-14 08:12:06,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:12:06,960 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-10-14 08:12:06,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:12:06,967 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-10-14 08:12:06,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:12:06,971 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-10-14 08:12:06,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:12:06,977 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-10-14 08:12:06,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:12:06,983 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-14 08:12:06,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:12:06,992 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2024-10-14 08:12:06,992 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 08:12:06,992 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1187735501] [2024-10-14 08:12:06,992 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1187735501] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 08:12:06,992 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 08:12:06,992 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 08:12:06,993 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [97821295] [2024-10-14 08:12:06,993 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 08:12:06,994 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 08:12:06,994 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 08:12:06,994 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 08:12:06,995 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 08:12:06,995 INFO L87 Difference]: Start difference. First operand 76 states and 117 transitions. Second operand has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 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-10-14 08:12:07,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 08:12:07,085 INFO L93 Difference]: Finished difference Result 226 states and 349 transitions. [2024-10-14 08:12:07,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 08:12:07,086 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 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 177 [2024-10-14 08:12:07,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 08:12:07,089 INFO L225 Difference]: With dead ends: 226 [2024-10-14 08:12:07,089 INFO L226 Difference]: Without dead ends: 151 [2024-10-14 08:12:07,093 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-10-14 08:12:07,094 INFO L432 NwaCegarLoop]: 110 mSDtfsCounter, 58 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 215 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 08:12:07,095 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 215 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 08:12:07,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2024-10-14 08:12:07,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 147. [2024-10-14 08:12:07,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 86 states have (on average 1.2790697674418605) internal successors, (110), 86 states have internal predecessors, (110), 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-10-14 08:12:07,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 226 transitions. [2024-10-14 08:12:07,162 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 226 transitions. Word has length 177 [2024-10-14 08:12:07,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 08:12:07,162 INFO L471 AbstractCegarLoop]: Abstraction has 147 states and 226 transitions. [2024-10-14 08:12:07,163 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 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-10-14 08:12:07,163 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 226 transitions. [2024-10-14 08:12:07,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2024-10-14 08:12:07,169 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 08:12:07,169 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] [2024-10-14 08:12:07,169 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-14 08:12:07,170 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 08:12:07,170 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 08:12:07,170 INFO L85 PathProgramCache]: Analyzing trace with hash 489791592, now seen corresponding path program 1 times [2024-10-14 08:12:07,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 08:12:07,170 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [504696046] [2024-10-14 08:12:07,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 08:12:07,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 08:12:07,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:12:07,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 08:12:07,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:12:07,433 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 08:12:07,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:12:07,437 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 08:12:07,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:12:07,439 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 08:12:07,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:12:07,442 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 08:12:07,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:12:07,445 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-14 08:12:07,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:12:07,448 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-14 08:12:07,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:12:07,451 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-14 08:12:07,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:12:07,453 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-14 08:12:07,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:12:07,455 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-14 08:12:07,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:12:07,459 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-14 08:12:07,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:12:07,464 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-14 08:12:07,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:12:07,467 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-14 08:12:07,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:12:07,468 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-14 08:12:07,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:12:07,472 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-14 08:12:07,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:12:07,479 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-14 08:12:07,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:12:07,485 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-14 08:12:07,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:12:07,490 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-14 08:12:07,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:12:07,493 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-10-14 08:12:07,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:12:07,496 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-14 08:12:07,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:12:07,498 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-10-14 08:12:07,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:12:07,503 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-14 08:12:07,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:12:07,505 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-14 08:12:07,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:12:07,508 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-14 08:12:07,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:12:07,510 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-10-14 08:12:07,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:12:07,517 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-10-14 08:12:07,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:12:07,521 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-10-14 08:12:07,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:12:07,524 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-10-14 08:12:07,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:12:07,528 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-14 08:12:07,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:12:07,532 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2024-10-14 08:12:07,532 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 08:12:07,533 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [504696046] [2024-10-14 08:12:07,533 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [504696046] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 08:12:07,533 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 08:12:07,533 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 08:12:07,534 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [770274449] [2024-10-14 08:12:07,534 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 08:12:07,534 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 08:12:07,534 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 08:12:07,535 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 08:12:07,535 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-14 08:12:07,535 INFO L87 Difference]: Start difference. First operand 147 states and 226 transitions. Second operand has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 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-10-14 08:12:07,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 08:12:07,758 INFO L93 Difference]: Finished difference Result 295 states and 455 transitions. [2024-10-14 08:12:07,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 08:12:07,760 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 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 178 [2024-10-14 08:12:07,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 08:12:07,764 INFO L225 Difference]: With dead ends: 295 [2024-10-14 08:12:07,764 INFO L226 Difference]: Without dead ends: 149 [2024-10-14 08:12:07,767 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-10-14 08:12:07,768 INFO L432 NwaCegarLoop]: 106 mSDtfsCounter, 115 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 150 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 08:12:07,770 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 150 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 08:12:07,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2024-10-14 08:12:07,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 149. [2024-10-14 08:12:07,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149 states, 88 states have (on average 1.2727272727272727) internal successors, (112), 88 states have internal predecessors, (112), 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-10-14 08:12:07,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 228 transitions. [2024-10-14 08:12:07,792 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 228 transitions. Word has length 178 [2024-10-14 08:12:07,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 08:12:07,792 INFO L471 AbstractCegarLoop]: Abstraction has 149 states and 228 transitions. [2024-10-14 08:12:07,792 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 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-10-14 08:12:07,793 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 228 transitions. [2024-10-14 08:12:07,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2024-10-14 08:12:07,795 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 08:12:07,795 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-10-14 08:12:07,795 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-14 08:12:07,795 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 08:12:07,796 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 08:12:07,796 INFO L85 PathProgramCache]: Analyzing trace with hash 1757401306, now seen corresponding path program 1 times [2024-10-14 08:12:07,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 08:12:07,796 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1737476938] [2024-10-14 08:12:07,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 08:12:07,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 08:12:07,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-14 08:12:07,909 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-14 08:12:08,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-14 08:12:08,065 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-14 08:12:08,066 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-14 08:12:08,066 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-14 08:12:08,068 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-14 08:12:08,070 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-10-14 08:12:08,183 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-14 08:12:08,187 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.10 08:12:08 BoogieIcfgContainer [2024-10-14 08:12:08,188 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-14 08:12:08,188 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-14 08:12:08,188 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-14 08:12:08,188 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-14 08:12:08,189 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 08:12:05" (3/4) ... [2024-10-14 08:12:08,191 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-14 08:12:08,191 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-14 08:12:08,192 INFO L158 Benchmark]: Toolchain (without parser) took 3456.04ms. Allocated memory was 176.2MB in the beginning and 247.5MB in the end (delta: 71.3MB). Free memory was 109.3MB in the beginning and 133.2MB in the end (delta: -23.9MB). Peak memory consumption was 49.1MB. Max. memory is 16.1GB. [2024-10-14 08:12:08,192 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 104.9MB. Free memory is still 66.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-14 08:12:08,192 INFO L158 Benchmark]: CACSL2BoogieTranslator took 391.96ms. Allocated memory is still 176.2MB. Free memory was 109.2MB in the beginning and 145.1MB in the end (delta: -36.0MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-10-14 08:12:08,193 INFO L158 Benchmark]: Boogie Procedure Inliner took 60.23ms. Allocated memory is still 176.2MB. Free memory was 145.1MB in the beginning and 142.5MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-14 08:12:08,193 INFO L158 Benchmark]: Boogie Preprocessor took 54.09ms. Allocated memory is still 176.2MB. Free memory was 142.5MB in the beginning and 138.3MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-14 08:12:08,193 INFO L158 Benchmark]: RCFGBuilder took 487.02ms. Allocated memory is still 176.2MB. Free memory was 138.3MB in the beginning and 113.2MB in the end (delta: 25.1MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-10-14 08:12:08,193 INFO L158 Benchmark]: TraceAbstraction took 2453.39ms. Allocated memory was 176.2MB in the beginning and 247.5MB in the end (delta: 71.3MB). Free memory was 112.5MB in the beginning and 133.2MB in the end (delta: -20.8MB). Peak memory consumption was 51.2MB. Max. memory is 16.1GB. [2024-10-14 08:12:08,194 INFO L158 Benchmark]: Witness Printer took 3.27ms. Allocated memory is still 247.5MB. Free memory is still 133.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-14 08:12:08,199 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.13ms. Allocated memory is still 104.9MB. Free memory is still 66.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 391.96ms. Allocated memory is still 176.2MB. Free memory was 109.2MB in the beginning and 145.1MB in the end (delta: -36.0MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 60.23ms. Allocated memory is still 176.2MB. Free memory was 145.1MB in the beginning and 142.5MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 54.09ms. Allocated memory is still 176.2MB. Free memory was 142.5MB in the beginning and 138.3MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 487.02ms. Allocated memory is still 176.2MB. Free memory was 138.3MB in the beginning and 113.2MB in the end (delta: 25.1MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 2453.39ms. Allocated memory was 176.2MB in the beginning and 247.5MB in the end (delta: 71.3MB). Free memory was 112.5MB in the beginning and 133.2MB in the end (delta: -20.8MB). Peak memory consumption was 51.2MB. Max. memory is 16.1GB. * Witness Printer took 3.27ms. Allocated memory is still 247.5MB. Free memory is still 133.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; [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=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] [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=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] [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=0, 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_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=0, 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=0, 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_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=0, 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=0, 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_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=0, 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=0, 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_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=0, 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=0, 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=0, 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=0, 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=0, 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=0, 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=0, 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=0, 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=0, 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=0, 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=0, 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=0, 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=0, 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=0, 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=0, 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=0, 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=0, 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=0, 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=0, 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=0, 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=0, 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=0, 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=0, 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=0, 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=0, 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=0, 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=0, 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=0, 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=0, 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=0, 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=0, 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=0, 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=0, 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=0, 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=0, 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=0, 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=0, 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=32766, 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_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=32766, 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_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=32766, 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_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=32766, 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_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=32766, 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_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=32766, 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_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=32766, 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=0, 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=32766, 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=0, 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=32766, 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=0, 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=32766, 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=0, 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=32766, 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=0, 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=32766, 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=0, 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=32766, 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=0, 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=32766, 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=0, 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=32766, 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=0, 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=32766, var_1_25=32, var_1_26=65534, var_1_27=51/2, var_1_29=-10, var_1_2=1, var_1_30=11, var_1_31=-5, var_1_32=1, var_1_33=399/2, var_1_34=4, var_1_3=0, 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=32766, var_1_25=32, var_1_26=65534, var_1_27=51/2, var_1_29=-10, var_1_2=1, var_1_30=11, var_1_31=-5, var_1_32=1, var_1_33=399/2, var_1_34=4, var_1_3=0, 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=32766, var_1_25=32, var_1_26=65534, var_1_27=51/2, var_1_29=-10, var_1_2=1, var_1_30=11, var_1_31=-5, var_1_32=1, var_1_33=399/2, var_1_34=4, var_1_3=0, 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=32766, var_1_25=32, var_1_26=65534, var_1_27=51/2, var_1_29=-10, var_1_2=1, var_1_30=11, var_1_31=-5, var_1_32=1, var_1_33=399/2, var_1_34=4, var_1_3=0, 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=32766, var_1_25=32, var_1_26=65534, var_1_27=51/2, var_1_29=-10, var_1_2=1, var_1_30=11, var_1_31=-5, var_1_32=1, var_1_33=399/2, var_1_34=4, var_1_3=0, 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=32766, var_1_25=32, var_1_26=65534, var_1_27=51/2, var_1_29=-10, var_1_2=1, var_1_30=11, var_1_31=-5, var_1_32=1, var_1_33=399/2, var_1_34=4, var_1_3=0, 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=32766, var_1_25=32, var_1_26=65534, var_1_27=51/2, var_1_29=-10, var_1_2=1, var_1_30=11, var_1_31=12, var_1_32=1, var_1_33=399/2, var_1_34=4, var_1_3=0, 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=32766, var_1_25=32, var_1_26=65534, var_1_27=51/2, var_1_29=-10, var_1_2=1, var_1_30=11, var_1_31=12, var_1_32=1, var_1_33=399/2, var_1_34=4, var_1_3=0, 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=32766, var_1_25=32, var_1_26=65534, var_1_27=51/2, var_1_29=-10, var_1_2=1, var_1_30=11, var_1_31=12, var_1_32=1, var_1_33=399/2, var_1_34=4, var_1_3=0, 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=32766, var_1_25=32, var_1_26=65534, var_1_27=51/2, var_1_29=-10, var_1_2=1, var_1_30=11, var_1_31=12, var_1_32=1, var_1_33=399/2, var_1_34=4, var_1_3=0, 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=32766, var_1_25=32, var_1_26=65534, var_1_27=51/2, var_1_29=-10, var_1_2=1, var_1_30=11, var_1_31=12, var_1_32=1, var_1_33=399/2, var_1_34=4, var_1_3=0, 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=32766, var_1_25=32, var_1_26=65534, var_1_27=51/2, var_1_29=-10, var_1_2=1, var_1_30=11, var_1_31=12, var_1_32=1, var_1_33=399/2, var_1_34=4, var_1_3=0, 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=32766, var_1_24=32766, var_1_25=65534, var_1_26=65534, var_1_27=65539, var_1_28=65539, var_1_29=11, var_1_2=1, var_1_30=11, var_1_31=12, var_1_32=1, var_1_33=65539, var_1_34=65534, var_1_3=0, 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=32766, var_1_24=32766, var_1_25=65534, var_1_26=65534, var_1_27=65539, var_1_28=65539, var_1_29=11, var_1_2=1, var_1_30=11, var_1_31=12, var_1_32=1, var_1_33=65539, var_1_34=65534, var_1_3=0, 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=32766, var_1_24=32766, var_1_25=65534, var_1_26=65534, var_1_27=65539, var_1_28=65539, var_1_29=11, var_1_2=1, var_1_30=11, var_1_31=12, var_1_32=1, var_1_33=65539, var_1_34=65534, var_1_3=0, 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=32766, var_1_24=32766, var_1_25=65534, var_1_26=65534, var_1_27=65539, var_1_28=65539, var_1_29=11, var_1_2=1, var_1_30=11, var_1_31=12, var_1_32=1, var_1_33=65539, var_1_34=65534, var_1_3=0, 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=32766, var_1_24=32766, var_1_25=65534, var_1_26=65534, var_1_27=65539, var_1_28=65539, var_1_29=11, var_1_2=1, var_1_30=11, var_1_31=12, var_1_32=1, var_1_33=65539, var_1_34=65534, var_1_3=0, 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=32766, var_1_24=32766, var_1_25=65534, var_1_26=65534, var_1_27=65539, var_1_28=65539, var_1_29=11, var_1_2=1, var_1_30=11, var_1_31=12, var_1_32=1, var_1_33=65539, var_1_34=65534, var_1_3=0, 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=32766, var_1_24=32766, var_1_25=65534, var_1_26=65534, var_1_27=65539, var_1_28=65539, var_1_29=11, var_1_2=1, var_1_30=11, var_1_31=12, var_1_32=1, var_1_33=65539, var_1_34=65534, var_1_3=0, 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=32766, var_1_24=32766, var_1_25=65534, var_1_26=65534, var_1_27=65539, var_1_28=65539, var_1_29=11, var_1_2=1, var_1_30=11, var_1_31=12, var_1_32=1, var_1_33=65539, var_1_34=65534, var_1_3=0, 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=32766, var_1_24=32766, var_1_25=65534, var_1_26=65534, var_1_27=65539, var_1_28=65539, var_1_29=11, var_1_2=1, var_1_30=11, var_1_31=12, var_1_32=1, var_1_33=65539, var_1_34=65534, var_1_3=0, 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=32766, var_1_24=32766, var_1_25=65534, var_1_26=65534, var_1_27=65539, var_1_28=65539, var_1_29=11, var_1_2=1, var_1_30=11, var_1_31=12, var_1_32=1, var_1_33=65539, var_1_34=65534, var_1_3=0, var_1_8=0] [L105] var_1_22 = var_1_8 [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=32766, var_1_24=32766, var_1_25=65534, var_1_26=65534, var_1_27=65539, var_1_28=65539, var_1_29=11, var_1_2=1, var_1_30=11, var_1_31=12, var_1_32=1, var_1_33=65539, var_1_34=65534, var_1_3=0, 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=32766, var_1_24=32766, var_1_25=65534, var_1_26=65534, var_1_27=65539, var_1_28=65539, var_1_29=11, var_1_2=1, var_1_30=11, var_1_31=12, var_1_32=1, var_1_33=65539, var_1_34=65534, var_1_3=0, 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=32766, var_1_24=32766, var_1_25=65534, var_1_26=65534, var_1_27=65539, var_1_28=65539, var_1_29=11, var_1_2=1, var_1_30=11, var_1_31=12, var_1_32=1, var_1_33=65539, var_1_34=65534, var_1_3=0, var_1_8=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 78 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 2.3s, OverallIterations: 4, TraceHistogramMax: 29, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 173 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 173 mSDsluCounter, 478 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 149 mSDsCounter, 2 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 105 IncrementalHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2 mSolverCounterUnsat, 329 mSDtfsCounter, 105 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=149occurred 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.2s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 711 NumberOfCodeBlocks, 711 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 529 ConstructedInterpolants, 0 QuantifiedInterpolants, 980 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-10-14 08:12:08,227 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/current/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 /storage/repos/ultimate/releaseScripts/default/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-wip.fs.cvc5-61a6796-m [2024-10-14 08:12:10,194 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 08:12:10,250 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-14 08:12:10,256 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 08:12:10,258 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 08:12:10,289 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 08:12:10,290 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 08:12:10,290 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 08:12:10,290 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 08:12:10,291 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 08:12:10,291 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 08:12:10,291 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 08:12:10,292 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 08:12:10,292 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 08:12:10,293 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 08:12:10,294 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 08:12:10,295 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 08:12:10,297 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 08:12:10,297 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 08:12:10,297 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 08:12:10,297 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 08:12:10,298 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 08:12:10,298 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 08:12:10,298 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-14 08:12:10,298 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-14 08:12:10,299 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 08:12:10,299 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-14 08:12:10,299 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 08:12:10,299 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 08:12:10,300 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 08:12:10,300 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 08:12:10,300 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 08:12:10,301 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 08:12:10,301 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 08:12:10,301 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 08:12:10,301 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 08:12:10,301 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 08:12:10,302 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-14 08:12:10,302 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-14 08:12:10,302 INFO L153 SettingsManager]: * Command for external solver=cvc5 --incremental --print-success --lang smt [2024-10-14 08:12:10,302 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 08:12:10,303 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 08:12:10,303 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 08:12:10,303 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 08:12:10,303 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-14 08:12:10,303 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-10-14 08:12:10,581 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 08:12:10,604 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 08:12:10,608 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 08:12:10,609 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 08:12:10,611 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 08:12:10,612 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-27.i [2024-10-14 08:12:11,944 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 08:12:12,127 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 08:12:12,128 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-27.i [2024-10-14 08:12:12,140 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5f24ca7d5/2ad45cd6cd074f5ebd771bc1f6771115/FLAG4817e5b26 [2024-10-14 08:12:12,155 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5f24ca7d5/2ad45cd6cd074f5ebd771bc1f6771115 [2024-10-14 08:12:12,157 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 08:12:12,158 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 08:12:12,161 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 08:12:12,161 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 08:12:12,167 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 08:12:12,167 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 08:12:12" (1/1) ... [2024-10-14 08:12:12,168 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5dbac808 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:12:12, skipping insertion in model container [2024-10-14 08:12:12,168 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 08:12:12" (1/1) ... [2024-10-14 08:12:12,195 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 08:12:12,350 WARN L248 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-10-14 08:12:12,424 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 08:12:12,443 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 08:12:12,455 WARN L248 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-10-14 08:12:12,491 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 08:12:12,510 INFO L204 MainTranslator]: Completed translation [2024-10-14 08:12:12,510 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:12:12 WrapperNode [2024-10-14 08:12:12,511 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 08:12:12,512 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 08:12:12,512 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 08:12:12,512 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 08:12:12,517 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:12:12" (1/1) ... [2024-10-14 08:12:12,535 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:12:12" (1/1) ... [2024-10-14 08:12:12,568 INFO L138 Inliner]: procedures = 27, calls = 42, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 179 [2024-10-14 08:12:12,568 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 08:12:12,569 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 08:12:12,572 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 08:12:12,572 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 08:12:12,585 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:12:12" (1/1) ... [2024-10-14 08:12:12,585 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:12:12" (1/1) ... [2024-10-14 08:12:12,591 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:12:12" (1/1) ... [2024-10-14 08:12:12,613 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-10-14 08:12:12,614 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:12:12" (1/1) ... [2024-10-14 08:12:12,614 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:12:12" (1/1) ... [2024-10-14 08:12:12,625 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:12:12" (1/1) ... [2024-10-14 08:12:12,635 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:12:12" (1/1) ... [2024-10-14 08:12:12,639 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:12:12" (1/1) ... [2024-10-14 08:12:12,641 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:12:12" (1/1) ... [2024-10-14 08:12:12,648 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 08:12:12,648 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 08:12:12,649 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 08:12:12,649 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 08:12:12,649 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:12:12" (1/1) ... [2024-10-14 08:12:12,657 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 08:12:12,667 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 08:12:12,683 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-10-14 08:12:12,686 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-10-14 08:12:12,723 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 08:12:12,723 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-14 08:12:12,723 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-14 08:12:12,723 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-14 08:12:12,723 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 08:12:12,724 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 08:12:12,796 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 08:12:12,797 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 08:12:17,567 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2024-10-14 08:12:17,567 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 08:12:17,625 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 08:12:17,626 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-14 08:12:17,626 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 08:12:17 BoogieIcfgContainer [2024-10-14 08:12:17,626 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 08:12:17,628 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 08:12:17,628 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 08:12:17,630 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 08:12:17,631 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 08:12:12" (1/3) ... [2024-10-14 08:12:17,631 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1687d7d1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 08:12:17, skipping insertion in model container [2024-10-14 08:12:17,631 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:12:12" (2/3) ... [2024-10-14 08:12:17,632 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1687d7d1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 08:12:17, skipping insertion in model container [2024-10-14 08:12:17,632 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 08:12:17" (3/3) ... [2024-10-14 08:12:17,633 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-10_file-27.i [2024-10-14 08:12:17,650 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 08:12:17,650 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-14 08:12:17,701 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 08:12:17,710 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;@58e274fb, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 08:12:17,710 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-14 08:12:17,717 INFO L276 IsEmpty]: Start isEmpty. Operand has 71 states, 39 states have (on average 1.3846153846153846) internal successors, (54), 40 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-10-14 08:12:17,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2024-10-14 08:12:17,730 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 08:12:17,731 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] [2024-10-14 08:12:17,731 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 08:12:17,737 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 08:12:17,737 INFO L85 PathProgramCache]: Analyzing trace with hash -1537356964, now seen corresponding path program 1 times [2024-10-14 08:12:17,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 08:12:17,766 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [681723457] [2024-10-14 08:12:17,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 08:12:17,767 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-10-14 08:12:17,767 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 08:12:17,774 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-10-14 08:12:17,775 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-10-14 08:12:18,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:12:18,193 INFO L255 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-14 08:12:18,209 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 08:12:18,255 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 740 proven. 0 refuted. 0 times theorem prover too weak. 884 trivial. 0 not checked. [2024-10-14 08:12:18,255 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 08:12:18,256 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 08:12:18,256 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [681723457] [2024-10-14 08:12:18,256 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [681723457] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 08:12:18,256 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 08:12:18,256 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 08:12:18,258 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2108716423] [2024-10-14 08:12:18,258 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 08:12:18,261 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-14 08:12:18,261 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 08:12:18,280 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-14 08:12:18,281 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-14 08:12:18,283 INFO L87 Difference]: Start difference. First operand has 71 states, 39 states have (on average 1.3846153846153846) internal successors, (54), 40 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) Second operand has 2 states, 2 states have (on average 18.0) internal successors, (36), 2 states have internal predecessors, (36), 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-10-14 08:12:20,643 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.32s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-14 08:12:20,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 08:12:20,644 INFO L93 Difference]: Finished difference Result 139 states and 251 transitions. [2024-10-14 08:12:20,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-14 08:12:20,675 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 18.0) internal successors, (36), 2 states have internal predecessors, (36), 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 174 [2024-10-14 08:12:20,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 08:12:20,684 INFO L225 Difference]: With dead ends: 139 [2024-10-14 08:12:20,685 INFO L226 Difference]: Without dead ends: 69 [2024-10-14 08:12:20,687 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 173 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-10-14 08:12:20,690 INFO L432 NwaCegarLoop]: 104 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 104 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2024-10-14 08:12:20,690 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 104 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2024-10-14 08:12:20,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2024-10-14 08:12:20,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2024-10-14 08:12:20,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 38 states have (on average 1.2894736842105263) internal successors, (49), 38 states have internal predecessors, (49), 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-10-14 08:12:20,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 107 transitions. [2024-10-14 08:12:20,726 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 107 transitions. Word has length 174 [2024-10-14 08:12:20,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 08:12:20,726 INFO L471 AbstractCegarLoop]: Abstraction has 69 states and 107 transitions. [2024-10-14 08:12:20,726 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 18.0) internal successors, (36), 2 states have internal predecessors, (36), 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-10-14 08:12:20,726 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 107 transitions. [2024-10-14 08:12:20,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2024-10-14 08:12:20,729 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 08:12:20,729 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] [2024-10-14 08:12:20,742 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-10-14 08:12:20,930 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-10-14 08:12:20,930 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 08:12:20,931 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 08:12:20,931 INFO L85 PathProgramCache]: Analyzing trace with hash 1405355538, now seen corresponding path program 1 times [2024-10-14 08:12:20,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 08:12:20,932 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [346720717] [2024-10-14 08:12:20,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 08:12:20,932 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-10-14 08:12:20,933 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 08:12:20,935 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-10-14 08:12:20,937 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-10-14 08:12:21,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:12:21,378 INFO L255 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-14 08:12:21,393 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 08:12:22,648 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 730 proven. 57 refuted. 0 times theorem prover too weak. 837 trivial. 0 not checked. [2024-10-14 08:12:22,648 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 08:12:23,207 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2024-10-14 08:12:23,207 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 08:12:23,208 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [346720717] [2024-10-14 08:12:23,208 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [346720717] provided 1 perfect and 1 imperfect interpolant sequences [2024-10-14 08:12:23,208 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-14 08:12:23,208 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2024-10-14 08:12:23,208 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1404602090] [2024-10-14 08:12:23,208 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 08:12:23,210 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 08:12:23,210 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 08:12:23,211 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 08:12:23,211 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-10-14 08:12:23,212 INFO L87 Difference]: Start difference. First operand 69 states and 107 transitions. Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 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-10-14 08:12:27,484 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.90s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-14 08:12:27,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 08:12:27,488 INFO L93 Difference]: Finished difference Result 141 states and 216 transitions. [2024-10-14 08:12:27,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 08:12:27,521 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 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 174 [2024-10-14 08:12:27,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 08:12:27,527 INFO L225 Difference]: With dead ends: 141 [2024-10-14 08:12:27,527 INFO L226 Difference]: Without dead ends: 73 [2024-10-14 08:12:27,528 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 346 GetRequests, 340 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-10-14 08:12:27,529 INFO L432 NwaCegarLoop]: 98 mSDtfsCounter, 48 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 153 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2024-10-14 08:12:27,529 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 153 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 4.3s Time] [2024-10-14 08:12:27,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2024-10-14 08:12:27,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2024-10-14 08:12:27,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 41 states have (on average 1.2439024390243902) internal successors, (51), 41 states have internal predecessors, (51), 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-10-14 08:12:27,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 109 transitions. [2024-10-14 08:12:27,542 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 109 transitions. Word has length 174 [2024-10-14 08:12:27,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 08:12:27,542 INFO L471 AbstractCegarLoop]: Abstraction has 73 states and 109 transitions. [2024-10-14 08:12:27,543 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 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-10-14 08:12:27,543 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 109 transitions. [2024-10-14 08:12:27,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2024-10-14 08:12:27,545 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 08:12:27,545 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] [2024-10-14 08:12:27,559 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-10-14 08:12:27,745 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-10-14 08:12:27,746 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 08:12:27,746 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 08:12:27,746 INFO L85 PathProgramCache]: Analyzing trace with hash 400145465, now seen corresponding path program 1 times [2024-10-14 08:12:27,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 08:12:27,747 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1236673084] [2024-10-14 08:12:27,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 08:12:27,747 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-10-14 08:12:27,748 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 08:12:27,749 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-10-14 08:12:27,750 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-10-14 08:12:28,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:12:28,126 INFO L255 TraceCheckSpWp]: Trace formula consists of 292 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-14 08:12:28,130 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 08:12:29,647 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2024-10-14 08:12:29,647 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 08:12:29,647 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 08:12:29,649 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1236673084] [2024-10-14 08:12:29,649 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1236673084] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 08:12:29,649 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 08:12:29,651 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 08:12:29,651 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [125673399] [2024-10-14 08:12:29,651 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 08:12:29,652 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 08:12:29,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 08:12:29,652 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 08:12:29,652 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 08:12:29,653 INFO L87 Difference]: Start difference. First operand 73 states and 109 transitions. Second operand has 4 states, 4 states have (on average 8.25) internal successors, (33), 3 states have internal predecessors, (33), 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-10-14 08:12:33,133 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.09s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-14 08:12:33,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 08:12:33,274 INFO L93 Difference]: Finished difference Result 217 states and 325 transitions. [2024-10-14 08:12:33,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 08:12:33,275 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 3 states have internal predecessors, (33), 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 175 [2024-10-14 08:12:33,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 08:12:33,277 INFO L225 Difference]: With dead ends: 217 [2024-10-14 08:12:33,277 INFO L226 Difference]: Without dead ends: 145 [2024-10-14 08:12:33,278 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 172 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-10-14 08:12:33,279 INFO L432 NwaCegarLoop]: 100 mSDtfsCounter, 16 mSDsluCounter, 193 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 293 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.6s IncrementalHoareTripleChecker+Time [2024-10-14 08:12:33,279 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 293 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 3.6s Time] [2024-10-14 08:12:33,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2024-10-14 08:12:33,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 141. [2024-10-14 08:12:33,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 78 states have (on average 1.205128205128205) internal successors, (94), 78 states have internal predecessors, (94), 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-10-14 08:12:33,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 210 transitions. [2024-10-14 08:12:33,310 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 210 transitions. Word has length 175 [2024-10-14 08:12:33,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 08:12:33,311 INFO L471 AbstractCegarLoop]: Abstraction has 141 states and 210 transitions. [2024-10-14 08:12:33,311 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 3 states have internal predecessors, (33), 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-10-14 08:12:33,312 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 210 transitions. [2024-10-14 08:12:33,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2024-10-14 08:12:33,321 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 08:12:33,321 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] [2024-10-14 08:12:33,335 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 (4)] Ended with exit code 0 [2024-10-14 08:12:33,521 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-10-14 08:12:33,522 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 08:12:33,522 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 08:12:33,522 INFO L85 PathProgramCache]: Analyzing trace with hash -727930626, now seen corresponding path program 1 times [2024-10-14 08:12:33,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 08:12:33,523 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [107289420] [2024-10-14 08:12:33,523 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 08:12:33,524 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-10-14 08:12:33,524 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 08:12:33,525 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-10-14 08:12:33,526 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-10-14 08:12:33,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:12:33,928 INFO L255 TraceCheckSpWp]: Trace formula consists of 292 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-14 08:12:33,933 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 08:12:38,872 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 46 proven. 672 refuted. 0 times theorem prover too weak. 906 trivial. 0 not checked. [2024-10-14 08:12:38,873 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 08:12:39,963 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 08:12:39,963 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [107289420] [2024-10-14 08:12:39,963 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [107289420] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 08:12:39,963 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc5 [1677075069] [2024-10-14 08:12:39,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 08:12:39,963 INFO L173 SolverBuilder]: Constructing external solver with command: cvc5 --incremental --print-success --lang smt [2024-10-14 08:12:39,964 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc5 [2024-10-14 08:12:39,965 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc5 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-10-14 08:12:39,966 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc5 --incremental --print-success --lang smt (6)] Waiting until timeout for monitored process [2024-10-14 08:12:40,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:12:40,450 INFO L255 TraceCheckSpWp]: Trace formula consists of 292 conjuncts, 114 conjuncts are in the unsatisfiable core [2024-10-14 08:12:40,467 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 08:13:36,570 WARN L286 SmtUtils]: Spent 9.15s on a formula simplification that was a NOOP. DAG size: 30 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)