./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-75.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 023d838f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-75.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 01255a2de244ad5f0e2f4316c1d9bc147d3be1eb9af8b3b357be1318db919a62 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 04:08:45,353 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 04:08:45,438 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-10 04:08:45,443 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 04:08:45,444 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 04:08:45,472 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 04:08:45,472 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 04:08:45,473 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 04:08:45,473 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 04:08:45,475 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 04:08:45,475 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 04:08:45,475 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 04:08:45,476 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 04:08:45,478 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 04:08:45,478 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 04:08:45,479 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 04:08:45,479 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 04:08:45,479 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 04:08:45,480 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 04:08:45,480 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 04:08:45,484 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 04:08:45,485 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 04:08:45,485 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 04:08:45,485 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 04:08:45,486 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 04:08:45,486 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 04:08:45,486 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 04:08:45,486 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 04:08:45,487 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 04:08:45,487 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 04:08:45,487 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 04:08:45,488 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 04:08:45,488 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 04:08:45,489 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 04:08:45,489 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 04:08:45,490 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 04:08:45,490 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 04:08:45,490 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-10 04:08:45,490 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 04:08:45,491 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 04:08:45,491 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 04:08:45,491 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 04:08:45,492 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 -> 01255a2de244ad5f0e2f4316c1d9bc147d3be1eb9af8b3b357be1318db919a62 [2024-11-10 04:08:45,799 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 04:08:45,822 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 04:08:45,827 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 04:08:45,828 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 04:08:45,829 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 04:08:45,830 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-75.i [2024-11-10 04:08:47,427 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 04:08:47,617 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 04:08:47,619 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-75.i [2024-11-10 04:08:47,628 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6b3c4ecd5/1fd8865c476349479263e154881a1b68/FLAG9968a70f5 [2024-11-10 04:08:47,981 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6b3c4ecd5/1fd8865c476349479263e154881a1b68 [2024-11-10 04:08:47,983 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 04:08:47,984 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 04:08:47,986 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 04:08:47,986 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 04:08:47,991 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 04:08:47,992 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 04:08:47" (1/1) ... [2024-11-10 04:08:47,993 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@33ea9866 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:08:47, skipping insertion in model container [2024-11-10 04:08:47,993 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 04:08:47" (1/1) ... [2024-11-10 04:08:48,019 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 04:08:48,195 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-75.i[915,928] [2024-11-10 04:08:48,282 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 04:08:48,296 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 04:08:48,308 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-75.i[915,928] [2024-11-10 04:08:48,342 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 04:08:48,360 INFO L204 MainTranslator]: Completed translation [2024-11-10 04:08:48,361 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:08:48 WrapperNode [2024-11-10 04:08:48,361 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 04:08:48,362 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 04:08:48,362 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 04:08:48,362 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 04:08:48,368 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:08:48" (1/1) ... [2024-11-10 04:08:48,378 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:08:48" (1/1) ... [2024-11-10 04:08:48,416 INFO L138 Inliner]: procedures = 26, calls = 39, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 224 [2024-11-10 04:08:48,420 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 04:08:48,421 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 04:08:48,421 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 04:08:48,422 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 04:08:48,441 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:08:48" (1/1) ... [2024-11-10 04:08:48,441 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:08:48" (1/1) ... [2024-11-10 04:08:48,451 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:08:48" (1/1) ... [2024-11-10 04:08:48,468 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-10 04:08:48,468 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:08:48" (1/1) ... [2024-11-10 04:08:48,468 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:08:48" (1/1) ... [2024-11-10 04:08:48,476 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:08:48" (1/1) ... [2024-11-10 04:08:48,478 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:08:48" (1/1) ... [2024-11-10 04:08:48,480 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:08:48" (1/1) ... [2024-11-10 04:08:48,481 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:08:48" (1/1) ... [2024-11-10 04:08:48,485 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 04:08:48,486 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 04:08:48,486 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 04:08:48,486 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 04:08:48,488 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:08:48" (1/1) ... [2024-11-10 04:08:48,496 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 04:08:48,509 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 04:08:48,530 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-10 04:08:48,534 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-10 04:08:48,585 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 04:08:48,586 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-10 04:08:48,586 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-10 04:08:48,586 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-10 04:08:48,586 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 04:08:48,586 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 04:08:48,689 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 04:08:48,691 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 04:08:49,074 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L153: havoc property_#t~bitwise24#1;havoc property_#t~ite26#1;havoc property_#t~bitwise25#1;havoc property_#t~short27#1; [2024-11-10 04:08:49,203 INFO L? ?]: Removed 20 outVars from TransFormulas that were not future-live. [2024-11-10 04:08:49,204 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 04:08:49,241 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 04:08:49,241 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 04:08:49,242 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 04:08:49 BoogieIcfgContainer [2024-11-10 04:08:49,242 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 04:08:49,244 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 04:08:49,247 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 04:08:49,250 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 04:08:49,250 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 04:08:47" (1/3) ... [2024-11-10 04:08:49,251 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@69c657c6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 04:08:49, skipping insertion in model container [2024-11-10 04:08:49,251 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:08:48" (2/3) ... [2024-11-10 04:08:49,251 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@69c657c6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 04:08:49, skipping insertion in model container [2024-11-10 04:08:49,252 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 04:08:49" (3/3) ... [2024-11-10 04:08:49,253 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-10_file-75.i [2024-11-10 04:08:49,268 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 04:08:49,268 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-10 04:08:49,333 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 04:08:49,340 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;@79289e62, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 04:08:49,340 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-10 04:08:49,345 INFO L276 IsEmpty]: Start isEmpty. Operand has 98 states, 69 states have (on average 1.391304347826087) internal successors, (96), 70 states have internal predecessors, (96), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-10 04:08:49,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2024-11-10 04:08:49,358 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 04:08:49,358 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 04:08:49,359 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 04:08:49,363 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 04:08:49,363 INFO L85 PathProgramCache]: Analyzing trace with hash 1826269194, now seen corresponding path program 1 times [2024-11-10 04:08:49,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 04:08:49,372 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [98859321] [2024-11-10 04:08:49,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 04:08:49,374 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 04:08:49,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:08:49,671 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 04:08:49,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:08:49,684 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 04:08:49,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:08:49,693 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 04:08:49,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:08:49,702 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-10 04:08:49,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:08:49,713 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-10 04:08:49,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:08:49,721 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-10 04:08:49,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:08:49,731 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-10 04:08:49,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:08:49,740 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-11-10 04:08:49,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:08:49,748 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-10 04:08:49,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:08:49,753 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-10 04:08:49,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:08:49,764 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-10 04:08:49,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:08:49,771 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-10 04:08:49,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:08:49,781 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-10 04:08:49,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:08:49,791 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-10 04:08:49,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:08:49,800 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-10 04:08:49,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:08:49,808 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-10 04:08:49,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:08:49,816 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-11-10 04:08:49,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:08:49,821 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-11-10 04:08:49,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:08:49,828 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-11-10 04:08:49,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:08:49,836 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-11-10 04:08:49,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:08:49,846 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-10 04:08:49,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:08:49,858 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-11-10 04:08:49,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:08:49,869 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-10 04:08:49,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:08:49,877 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-11-10 04:08:49,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:08:49,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-11-10 04:08:49,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:08:49,896 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-11-10 04:08:49,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:08:49,902 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-11-10 04:08:49,905 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 04:08:49,905 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [98859321] [2024-11-10 04:08:49,906 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [98859321] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 04:08:49,906 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 04:08:49,907 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 04:08:49,909 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [547364456] [2024-11-10 04:08:49,910 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 04:08:49,915 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-10 04:08:49,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 04:08:49,940 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-10 04:08:49,941 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 04:08:49,943 INFO L87 Difference]: Start difference. First operand has 98 states, 69 states have (on average 1.391304347826087) internal successors, (96), 70 states have internal predecessors, (96), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) Second operand has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 2 states have call successors, (26) [2024-11-10 04:08:49,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 04:08:49,986 INFO L93 Difference]: Finished difference Result 188 states and 315 transitions. [2024-11-10 04:08:49,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-10 04:08:49,989 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 2 states have call successors, (26) Word has length 172 [2024-11-10 04:08:49,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 04:08:49,996 INFO L225 Difference]: With dead ends: 188 [2024-11-10 04:08:49,996 INFO L226 Difference]: Without dead ends: 93 [2024-11-10 04:08:50,001 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 04:08:50,008 INFO L432 NwaCegarLoop]: 135 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, 135 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-11-10 04:08:50,010 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 135 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 04:08:50,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2024-11-10 04:08:50,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2024-11-10 04:08:50,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 65 states have (on average 1.3384615384615384) internal successors, (87), 65 states have internal predecessors, (87), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-10 04:08:50,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 139 transitions. [2024-11-10 04:08:50,082 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 139 transitions. Word has length 172 [2024-11-10 04:08:50,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 04:08:50,082 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 139 transitions. [2024-11-10 04:08:50,083 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 2 states have call successors, (26) [2024-11-10 04:08:50,083 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 139 transitions. [2024-11-10 04:08:50,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2024-11-10 04:08:50,090 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 04:08:50,091 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 04:08:50,091 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-10 04:08:50,091 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 04:08:50,092 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 04:08:50,092 INFO L85 PathProgramCache]: Analyzing trace with hash -1671792622, now seen corresponding path program 1 times [2024-11-10 04:08:50,092 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 04:08:50,092 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2077590178] [2024-11-10 04:08:50,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 04:08:50,093 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 04:08:50,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:08:50,619 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 04:08:50,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:08:50,624 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 04:08:50,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:08:50,629 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 04:08:50,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:08:50,634 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-10 04:08:50,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:08:50,645 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-10 04:08:50,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:08:50,649 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-10 04:08:50,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:08:50,654 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-10 04:08:50,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:08:50,657 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-11-10 04:08:50,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:08:50,661 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-10 04:08:50,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:08:50,667 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-10 04:08:50,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:08:50,672 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-10 04:08:50,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:08:50,676 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-10 04:08:50,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:08:50,679 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-10 04:08:50,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:08:50,683 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-10 04:08:50,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:08:50,689 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-10 04:08:50,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:08:50,695 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-10 04:08:50,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:08:50,701 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-11-10 04:08:50,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:08:50,705 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-11-10 04:08:50,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:08:50,711 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-11-10 04:08:50,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:08:50,716 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-11-10 04:08:50,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:08:50,721 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-10 04:08:50,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:08:50,726 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-11-10 04:08:50,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:08:50,731 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-10 04:08:50,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:08:50,736 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-11-10 04:08:50,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:08:50,743 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-11-10 04:08:50,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:08:50,747 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-11-10 04:08:50,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:08:50,754 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-11-10 04:08:50,756 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 04:08:50,757 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2077590178] [2024-11-10 04:08:50,757 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2077590178] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 04:08:50,757 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 04:08:50,757 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 04:08:50,757 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [176860759] [2024-11-10 04:08:50,758 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 04:08:50,759 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 04:08:50,760 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 04:08:50,762 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 04:08:50,762 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 04:08:50,763 INFO L87 Difference]: Start difference. First operand 93 states and 139 transitions. Second operand has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-10 04:08:50,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 04:08:50,865 INFO L93 Difference]: Finished difference Result 184 states and 277 transitions. [2024-11-10 04:08:50,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 04:08:50,869 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 173 [2024-11-10 04:08:50,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 04:08:50,871 INFO L225 Difference]: With dead ends: 184 [2024-11-10 04:08:50,872 INFO L226 Difference]: Without dead ends: 94 [2024-11-10 04:08:50,876 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 04:08:50,877 INFO L432 NwaCegarLoop]: 134 mSDtfsCounter, 0 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 239 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 04:08:50,878 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 239 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 04:08:50,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2024-11-10 04:08:50,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2024-11-10 04:08:50,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 66 states have (on average 1.3333333333333333) internal successors, (88), 66 states have internal predecessors, (88), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-10 04:08:50,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 140 transitions. [2024-11-10 04:08:50,897 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 140 transitions. Word has length 173 [2024-11-10 04:08:50,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 04:08:50,900 INFO L471 AbstractCegarLoop]: Abstraction has 94 states and 140 transitions. [2024-11-10 04:08:50,900 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-10 04:08:50,900 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 140 transitions. [2024-11-10 04:08:50,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2024-11-10 04:08:50,903 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 04:08:50,903 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 04:08:50,904 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-10 04:08:50,904 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 04:08:50,904 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 04:08:50,905 INFO L85 PathProgramCache]: Analyzing trace with hash 137108615, now seen corresponding path program 1 times [2024-11-10 04:08:50,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 04:08:50,905 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1361013275] [2024-11-10 04:08:50,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 04:08:50,906 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 04:08:50,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:08:51,168 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 04:08:51,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:08:51,171 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 04:08:51,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:08:51,174 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 04:08:51,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:08:51,176 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-10 04:08:51,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:08:51,179 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-10 04:08:51,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:08:51,182 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-10 04:08:51,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:08:51,184 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-10 04:08:51,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:08:51,188 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-11-10 04:08:51,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:08:51,190 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-10 04:08:51,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:08:51,193 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-10 04:08:51,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:08:51,195 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-10 04:08:51,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:08:51,197 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-10 04:08:51,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:08:51,204 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-10 04:08:51,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:08:51,208 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-10 04:08:51,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:08:51,210 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-10 04:08:51,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:08:51,218 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-10 04:08:51,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:08:51,220 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-11-10 04:08:51,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:08:51,223 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-11-10 04:08:51,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:08:51,225 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-11-10 04:08:51,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:08:51,227 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-11-10 04:08:51,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:08:51,229 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-10 04:08:51,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:08:51,231 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-11-10 04:08:51,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:08:51,237 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-10 04:08:51,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:08:51,239 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-11-10 04:08:51,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:08:51,241 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-11-10 04:08:51,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:08:51,245 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-11-10 04:08:51,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:08:51,251 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-11-10 04:08:51,251 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 04:08:51,251 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1361013275] [2024-11-10 04:08:51,252 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1361013275] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 04:08:51,252 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 04:08:51,252 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 04:08:51,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1576859927] [2024-11-10 04:08:51,253 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 04:08:51,253 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 04:08:51,255 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 04:08:51,255 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 04:08:51,255 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 04:08:51,256 INFO L87 Difference]: Start difference. First operand 94 states and 140 transitions. Second operand has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-10 04:08:51,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 04:08:51,307 INFO L93 Difference]: Finished difference Result 189 states and 280 transitions. [2024-11-10 04:08:51,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 04:08:51,307 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 174 [2024-11-10 04:08:51,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 04:08:51,310 INFO L225 Difference]: With dead ends: 189 [2024-11-10 04:08:51,311 INFO L226 Difference]: Without dead ends: 98 [2024-11-10 04:08:51,311 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 04:08:51,312 INFO L432 NwaCegarLoop]: 131 mSDtfsCounter, 125 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 142 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 04:08:51,313 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 142 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 04:08:51,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2024-11-10 04:08:51,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2024-11-10 04:08:51,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 69 states have (on average 1.289855072463768) internal successors, (89), 69 states have internal predecessors, (89), 26 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-10 04:08:51,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 141 transitions. [2024-11-10 04:08:51,327 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 141 transitions. Word has length 174 [2024-11-10 04:08:51,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 04:08:51,328 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 141 transitions. [2024-11-10 04:08:51,328 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-10 04:08:51,328 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 141 transitions. [2024-11-10 04:08:51,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2024-11-10 04:08:51,357 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 04:08:51,357 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 04:08:51,357 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-10 04:08:51,357 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 04:08:51,358 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 04:08:51,358 INFO L85 PathProgramCache]: Analyzing trace with hash -1500609897, now seen corresponding path program 1 times [2024-11-10 04:08:51,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 04:08:51,358 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [206153375] [2024-11-10 04:08:51,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 04:08:51,359 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 04:08:51,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:08:51,622 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 04:08:51,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:08:51,625 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 04:08:51,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:08:51,627 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 04:08:51,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:08:51,629 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-10 04:08:51,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:08:51,631 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-10 04:08:51,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:08:51,633 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-10 04:08:51,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:08:51,635 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-10 04:08:51,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:08:51,636 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-11-10 04:08:51,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:08:51,638 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-10 04:08:51,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:08:51,640 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-10 04:08:51,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:08:51,642 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-10 04:08:51,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:08:51,644 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-10 04:08:51,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:08:51,646 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-10 04:08:51,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:08:51,648 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-10 04:08:51,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:08:51,650 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-10 04:08:51,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:08:51,652 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-10 04:08:51,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:08:51,674 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-11-10 04:08:51,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:08:51,678 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-11-10 04:08:51,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:08:51,682 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-11-10 04:08:51,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:08:51,685 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-11-10 04:08:51,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:08:51,688 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-10 04:08:51,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:08:51,691 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-11-10 04:08:51,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:08:51,695 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-10 04:08:51,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:08:51,698 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-11-10 04:08:51,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:08:51,701 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-11-10 04:08:51,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:08:51,704 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-11-10 04:08:51,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:08:51,708 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 45 proven. 30 refuted. 0 times theorem prover too weak. 1225 trivial. 0 not checked. [2024-11-10 04:08:51,709 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 04:08:51,709 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [206153375] [2024-11-10 04:08:51,709 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [206153375] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 04:08:51,709 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2048387890] [2024-11-10 04:08:51,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 04:08:51,710 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 04:08:51,710 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 04:08:51,712 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 04:08:51,713 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-10 04:08:51,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:08:51,861 INFO L255 TraceCheckSpWp]: Trace formula consists of 398 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-10 04:08:51,871 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 04:08:52,084 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 655 proven. 30 refuted. 0 times theorem prover too weak. 615 trivial. 0 not checked. [2024-11-10 04:08:52,085 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 04:08:52,349 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 45 proven. 30 refuted. 0 times theorem prover too weak. 1225 trivial. 0 not checked. [2024-11-10 04:08:52,349 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2048387890] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 04:08:52,349 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 04:08:52,349 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2024-11-10 04:08:52,349 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1066681875] [2024-11-10 04:08:52,350 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 04:08:52,350 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-10 04:08:52,351 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 04:08:52,352 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-10 04:08:52,352 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2024-11-10 04:08:52,352 INFO L87 Difference]: Start difference. First operand 98 states and 141 transitions. Second operand has 11 states, 11 states have (on average 6.545454545454546) internal successors, (72), 11 states have internal predecessors, (72), 3 states have call successors, (46), 2 states have call predecessors, (46), 4 states have return successors, (47), 3 states have call predecessors, (47), 3 states have call successors, (47) [2024-11-10 04:08:53,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 04:08:53,060 INFO L93 Difference]: Finished difference Result 266 states and 375 transitions. [2024-11-10 04:08:53,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-10 04:08:53,061 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 6.545454545454546) internal successors, (72), 11 states have internal predecessors, (72), 3 states have call successors, (46), 2 states have call predecessors, (46), 4 states have return successors, (47), 3 states have call predecessors, (47), 3 states have call successors, (47) Word has length 175 [2024-11-10 04:08:53,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 04:08:53,065 INFO L225 Difference]: With dead ends: 266 [2024-11-10 04:08:53,068 INFO L226 Difference]: Without dead ends: 171 [2024-11-10 04:08:53,069 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 421 GetRequests, 400 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=162, Invalid=344, Unknown=0, NotChecked=0, Total=506 [2024-11-10 04:08:53,070 INFO L432 NwaCegarLoop]: 128 mSDtfsCounter, 311 mSDsluCounter, 174 mSDsCounter, 0 mSdLazyCounter, 409 mSolverCounterSat, 227 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 313 SdHoareTripleChecker+Valid, 302 SdHoareTripleChecker+Invalid, 636 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 227 IncrementalHoareTripleChecker+Valid, 409 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-10 04:08:53,072 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [313 Valid, 302 Invalid, 636 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [227 Valid, 409 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-10 04:08:53,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2024-11-10 04:08:53,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 101. [2024-11-10 04:08:53,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 71 states have (on average 1.1690140845070423) internal successors, (83), 71 states have internal predecessors, (83), 26 states have call successors, (26), 3 states have call predecessors, (26), 3 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-10 04:08:53,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 135 transitions. [2024-11-10 04:08:53,101 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 135 transitions. Word has length 175 [2024-11-10 04:08:53,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 04:08:53,101 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 135 transitions. [2024-11-10 04:08:53,102 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.545454545454546) internal successors, (72), 11 states have internal predecessors, (72), 3 states have call successors, (46), 2 states have call predecessors, (46), 4 states have return successors, (47), 3 states have call predecessors, (47), 3 states have call successors, (47) [2024-11-10 04:08:53,102 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 135 transitions. [2024-11-10 04:08:53,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2024-11-10 04:08:53,106 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 04:08:53,106 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 04:08:53,125 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-10 04:08:53,307 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 04:08:53,308 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 04:08:53,308 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 04:08:53,309 INFO L85 PathProgramCache]: Analyzing trace with hash 743008990, now seen corresponding path program 1 times [2024-11-10 04:08:53,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 04:08:53,309 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1338896143] [2024-11-10 04:08:53,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 04:08:53,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 04:08:53,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:08:53,718 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 04:08:53,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:08:53,721 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 04:08:53,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:08:53,722 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 04:08:53,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:08:53,724 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-10 04:08:53,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:08:53,726 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-10 04:08:53,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:08:53,728 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-10 04:08:53,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:08:53,729 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-10 04:08:53,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:08:53,731 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-11-10 04:08:53,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:08:53,733 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-10 04:08:53,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:08:53,734 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-10 04:08:53,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:08:53,736 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-10 04:08:53,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:08:53,738 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-10 04:08:53,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:08:53,739 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-10 04:08:53,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:08:53,741 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-10 04:08:53,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:08:53,743 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-10 04:08:53,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:08:53,744 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-10 04:08:53,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:08:53,767 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-11-10 04:08:53,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:08:53,771 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-11-10 04:08:53,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:08:53,773 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-11-10 04:08:53,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:08:53,777 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-11-10 04:08:53,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:08:53,780 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-10 04:08:53,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:08:53,783 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-11-10 04:08:53,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:08:53,786 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-10 04:08:53,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:08:53,789 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-11-10 04:08:53,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:08:53,792 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-11-10 04:08:53,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:08:53,795 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-11-10 04:08:53,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:08:53,798 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 45 proven. 30 refuted. 0 times theorem prover too weak. 1225 trivial. 0 not checked. [2024-11-10 04:08:53,799 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 04:08:53,799 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1338896143] [2024-11-10 04:08:53,799 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1338896143] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 04:08:53,799 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1326627218] [2024-11-10 04:08:53,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 04:08:53,799 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 04:08:53,799 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 04:08:53,801 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 04:08:53,803 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-10 04:08:54,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:08:54,153 INFO L255 TraceCheckSpWp]: Trace formula consists of 398 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-10 04:08:54,157 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 04:08:54,338 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 655 proven. 30 refuted. 0 times theorem prover too weak. 615 trivial. 0 not checked. [2024-11-10 04:08:54,339 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 04:08:54,636 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 45 proven. 30 refuted. 0 times theorem prover too weak. 1225 trivial. 0 not checked. [2024-11-10 04:08:54,636 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1326627218] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 04:08:54,637 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 04:08:54,637 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 8] total 15 [2024-11-10 04:08:54,637 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [239428498] [2024-11-10 04:08:54,637 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 04:08:54,638 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-10 04:08:54,638 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 04:08:54,639 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-10 04:08:54,639 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=164, Unknown=0, NotChecked=0, Total=210 [2024-11-10 04:08:54,640 INFO L87 Difference]: Start difference. First operand 101 states and 135 transitions. Second operand has 15 states, 15 states have (on average 5.2) internal successors, (78), 15 states have internal predecessors, (78), 3 states have call successors, (46), 2 states have call predecessors, (46), 4 states have return successors, (47), 3 states have call predecessors, (47), 3 states have call successors, (47) [2024-11-10 04:08:55,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 04:08:55,574 INFO L93 Difference]: Finished difference Result 269 states and 361 transitions. [2024-11-10 04:08:55,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-10 04:08:55,574 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 5.2) internal successors, (78), 15 states have internal predecessors, (78), 3 states have call successors, (46), 2 states have call predecessors, (46), 4 states have return successors, (47), 3 states have call predecessors, (47), 3 states have call successors, (47) Word has length 176 [2024-11-10 04:08:55,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 04:08:55,577 INFO L225 Difference]: With dead ends: 269 [2024-11-10 04:08:55,577 INFO L226 Difference]: Without dead ends: 171 [2024-11-10 04:08:55,578 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 421 GetRequests, 398 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=152, Invalid=448, Unknown=0, NotChecked=0, Total=600 [2024-11-10 04:08:55,579 INFO L432 NwaCegarLoop]: 128 mSDtfsCounter, 223 mSDsluCounter, 558 mSDsCounter, 0 mSdLazyCounter, 756 mSolverCounterSat, 108 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 239 SdHoareTripleChecker+Valid, 686 SdHoareTripleChecker+Invalid, 864 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 108 IncrementalHoareTripleChecker+Valid, 756 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-10 04:08:55,579 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [239 Valid, 686 Invalid, 864 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [108 Valid, 756 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-10 04:08:55,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2024-11-10 04:08:55,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 101. [2024-11-10 04:08:55,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 71 states have (on average 1.1549295774647887) internal successors, (82), 71 states have internal predecessors, (82), 26 states have call successors, (26), 3 states have call predecessors, (26), 3 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-10 04:08:55,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 134 transitions. [2024-11-10 04:08:55,604 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 134 transitions. Word has length 176 [2024-11-10 04:08:55,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 04:08:55,606 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 134 transitions. [2024-11-10 04:08:55,607 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 5.2) internal successors, (78), 15 states have internal predecessors, (78), 3 states have call successors, (46), 2 states have call predecessors, (46), 4 states have return successors, (47), 3 states have call predecessors, (47), 3 states have call successors, (47) [2024-11-10 04:08:55,607 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 134 transitions. [2024-11-10 04:08:55,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2024-11-10 04:08:55,610 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 04:08:55,610 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 04:08:55,630 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-10 04:08:55,811 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 04:08:55,812 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 04:08:55,813 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 04:08:55,813 INFO L85 PathProgramCache]: Analyzing trace with hash 1977660733, now seen corresponding path program 1 times [2024-11-10 04:08:55,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 04:08:55,813 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1880852363] [2024-11-10 04:08:55,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 04:08:55,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 04:08:55,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 04:08:55,861 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 04:08:55,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 04:08:55,972 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 04:08:55,973 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-10 04:08:55,974 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-10 04:08:55,976 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-10 04:08:55,978 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2024-11-10 04:08:56,097 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-10 04:08:56,100 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 04:08:56 BoogieIcfgContainer [2024-11-10 04:08:56,101 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-10 04:08:56,103 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-10 04:08:56,103 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-10 04:08:56,104 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-10 04:08:56,104 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 04:08:49" (3/4) ... [2024-11-10 04:08:56,106 INFO L146 WitnessPrinter]: No result that supports witness generation found [2024-11-10 04:08:56,108 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-10 04:08:56,108 INFO L158 Benchmark]: Toolchain (without parser) took 8123.82ms. Allocated memory was 167.8MB in the beginning and 302.0MB in the end (delta: 134.2MB). Free memory was 110.7MB in the beginning and 167.0MB in the end (delta: -56.3MB). Peak memory consumption was 79.8MB. Max. memory is 16.1GB. [2024-11-10 04:08:56,108 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 167.8MB. Free memory is still 131.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 04:08:56,109 INFO L158 Benchmark]: CACSL2BoogieTranslator took 375.16ms. Allocated memory is still 167.8MB. Free memory was 110.7MB in the beginning and 94.9MB in the end (delta: 15.8MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-10 04:08:56,109 INFO L158 Benchmark]: Boogie Procedure Inliner took 58.66ms. Allocated memory is still 167.8MB. Free memory was 94.4MB in the beginning and 91.9MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-10 04:08:56,109 INFO L158 Benchmark]: Boogie Preprocessor took 63.60ms. Allocated memory is still 167.8MB. Free memory was 91.9MB in the beginning and 88.8MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-10 04:08:56,109 INFO L158 Benchmark]: IcfgBuilder took 756.39ms. Allocated memory is still 167.8MB. Free memory was 88.8MB in the beginning and 131.5MB in the end (delta: -42.7MB). Peak memory consumption was 24.5MB. Max. memory is 16.1GB. [2024-11-10 04:08:56,110 INFO L158 Benchmark]: TraceAbstraction took 6856.71ms. Allocated memory was 167.8MB in the beginning and 302.0MB in the end (delta: 134.2MB). Free memory was 130.4MB in the beginning and 167.0MB in the end (delta: -36.7MB). Peak memory consumption was 99.4MB. Max. memory is 16.1GB. [2024-11-10 04:08:56,110 INFO L158 Benchmark]: Witness Printer took 4.56ms. Allocated memory is still 302.0MB. Free memory is still 167.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 04:08:56,112 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.22ms. Allocated memory is still 167.8MB. Free memory is still 131.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 375.16ms. Allocated memory is still 167.8MB. Free memory was 110.7MB in the beginning and 94.9MB in the end (delta: 15.8MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 58.66ms. Allocated memory is still 167.8MB. Free memory was 94.4MB in the beginning and 91.9MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 63.60ms. Allocated memory is still 167.8MB. Free memory was 91.9MB in the beginning and 88.8MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * IcfgBuilder took 756.39ms. Allocated memory is still 167.8MB. Free memory was 88.8MB in the beginning and 131.5MB in the end (delta: -42.7MB). Peak memory consumption was 24.5MB. Max. memory is 16.1GB. * TraceAbstraction took 6856.71ms. Allocated memory was 167.8MB in the beginning and 302.0MB in the end (delta: 134.2MB). Free memory was 130.4MB in the beginning and 167.0MB in the end (delta: -36.7MB). Peak memory consumption was 99.4MB. Max. memory is 16.1GB. * Witness Printer took 4.56ms. Allocated memory is still 302.0MB. Free memory is still 167.0MB. 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 153, overapproximation of bitwiseOr at line 68, overapproximation of someBinaryDOUBLEComparisonOperation at line 153, overapproximation of someBinaryArithmeticFLOAToperation at line 98. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] float var_1_1 = 63.6; [L23] float var_1_4 = 128.75; [L24] float var_1_5 = 25.125; [L25] float var_1_6 = 1000000.75; [L26] unsigned char var_1_7 = 1; [L27] unsigned char var_1_11 = 0; [L28] unsigned char var_1_12 = 0; [L29] unsigned char var_1_13 = 0; [L30] unsigned char var_1_14 = 0; [L31] float var_1_15 = 25.75; [L32] double var_1_16 = 0.4; [L33] double var_1_17 = 0.0; [L34] double var_1_18 = 0.0; [L35] double var_1_19 = 1000000000000.5; [L36] double var_1_20 = 24.8; [L37] signed char var_1_21 = 1; [L38] double var_1_22 = 200.8; [L39] unsigned short int var_1_23 = 40076; [L40] unsigned short int var_1_24 = 8; [L41] unsigned long int var_1_25 = 2; [L42] unsigned char var_1_26 = 0; [L43] signed char var_1_27 = 4; [L44] signed char var_1_28 = 0; [L45] double var_1_29 = 64.5; [L46] double var_1_30 = 9.875; [L47] unsigned short int var_1_31 = 128; [L48] unsigned short int var_1_32 = 1; [L49] unsigned char var_1_33 = 128; [L50] unsigned char var_1_34 = 10; [L51] double last_1_var_1_22 = 200.8; VAL [isInitial=0, last_1_var_1_22=1004/5, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_17=0, var_1_18=0, var_1_19=2000000000001/2, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_26=0, var_1_27=4, var_1_28=0, var_1_29=129/2, var_1_30=79/8, var_1_31=128, var_1_32=1, var_1_33=128, var_1_34=10, var_1_4=515/4, var_1_5=201/8, var_1_6=4000003/4, var_1_7=1] [L157] isInitial = 1 [L158] FCALL initially() [L159] COND TRUE 1 [L160] CALL updateLastVariables() [L150] last_1_var_1_22 = var_1_22 VAL [isInitial=1, last_1_var_1_22=1004/5, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_17=0, var_1_18=0, var_1_19=2000000000001/2, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_26=0, var_1_27=4, var_1_28=0, var_1_29=129/2, var_1_30=79/8, var_1_31=128, var_1_32=1, var_1_33=128, var_1_34=10, var_1_4=515/4, var_1_5=201/8, var_1_6=4000003/4, var_1_7=1] [L160] RET updateLastVariables() [L161] CALL updateVariables() [L105] var_1_4 = __VERIFIER_nondet_float() [L106] CALL assume_abort_if_not((var_1_4 >= -461168.6018427382800e+13F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 4611686.018427382800e+12F && var_1_4 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_17=0, var_1_18=0, var_1_19=2000000000001/2, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_26=0, var_1_27=4, var_1_28=0, var_1_29=129/2, var_1_30=79/8, var_1_31=128, var_1_32=1, var_1_33=128, var_1_34=10, var_1_5=201/8, var_1_6=4000003/4, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_17=0, var_1_18=0, var_1_19=2000000000001/2, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_26=0, var_1_27=4, var_1_28=0, var_1_29=129/2, var_1_30=79/8, var_1_31=128, var_1_32=1, var_1_33=128, var_1_34=10, var_1_5=201/8, var_1_6=4000003/4, var_1_7=1] [L106] RET assume_abort_if_not((var_1_4 >= -461168.6018427382800e+13F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 4611686.018427382800e+12F && var_1_4 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_22=1004/5, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_17=0, var_1_18=0, var_1_19=2000000000001/2, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_26=0, var_1_27=4, var_1_28=0, var_1_29=129/2, var_1_30=79/8, var_1_31=128, var_1_32=1, var_1_33=128, var_1_34=10, var_1_5=201/8, var_1_6=4000003/4, var_1_7=1] [L107] var_1_5 = __VERIFIER_nondet_float() [L108] CALL assume_abort_if_not((var_1_5 >= -230584.3009213691390e+13F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 2305843.009213691390e+12F && var_1_5 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_17=0, var_1_18=0, var_1_19=2000000000001/2, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_26=0, var_1_27=4, var_1_28=0, var_1_29=129/2, var_1_30=79/8, var_1_31=128, var_1_32=1, var_1_33=128, var_1_34=10, var_1_6=4000003/4, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_17=0, var_1_18=0, var_1_19=2000000000001/2, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_26=0, var_1_27=4, var_1_28=0, var_1_29=129/2, var_1_30=79/8, var_1_31=128, var_1_32=1, var_1_33=128, var_1_34=10, var_1_6=4000003/4, var_1_7=1] [L108] RET assume_abort_if_not((var_1_5 >= -230584.3009213691390e+13F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 2305843.009213691390e+12F && var_1_5 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_22=1004/5, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_17=0, var_1_18=0, var_1_19=2000000000001/2, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_26=0, var_1_27=4, var_1_28=0, var_1_29=129/2, var_1_30=79/8, var_1_31=128, var_1_32=1, var_1_33=128, var_1_34=10, var_1_6=4000003/4, var_1_7=1] [L109] var_1_6 = __VERIFIER_nondet_float() [L110] CALL assume_abort_if_not((var_1_6 >= -230584.3009213691390e+13F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 2305843.009213691390e+12F && var_1_6 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_17=0, var_1_18=0, var_1_19=2000000000001/2, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_26=0, var_1_27=4, var_1_28=0, var_1_29=129/2, var_1_30=79/8, var_1_31=128, var_1_32=1, var_1_33=128, var_1_34=10, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_17=0, var_1_18=0, var_1_19=2000000000001/2, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_26=0, var_1_27=4, var_1_28=0, var_1_29=129/2, var_1_30=79/8, var_1_31=128, var_1_32=1, var_1_33=128, var_1_34=10, var_1_7=1] [L110] RET assume_abort_if_not((var_1_6 >= -230584.3009213691390e+13F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 2305843.009213691390e+12F && var_1_6 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_22=1004/5, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_17=0, var_1_18=0, var_1_19=2000000000001/2, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_26=0, var_1_27=4, var_1_28=0, var_1_29=129/2, var_1_30=79/8, var_1_31=128, var_1_32=1, var_1_33=128, var_1_34=10, var_1_7=1] [L111] var_1_11 = __VERIFIER_nondet_uchar() [L112] CALL assume_abort_if_not(var_1_11 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_17=0, var_1_18=0, var_1_19=2000000000001/2, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_26=0, var_1_27=4, var_1_28=0, var_1_29=129/2, var_1_30=79/8, var_1_31=128, var_1_32=1, var_1_33=128, var_1_34=10, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_17=0, var_1_18=0, var_1_19=2000000000001/2, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_26=0, var_1_27=4, var_1_28=0, var_1_29=129/2, var_1_30=79/8, var_1_31=128, var_1_32=1, var_1_33=128, var_1_34=10, var_1_7=1] [L112] RET assume_abort_if_not(var_1_11 >= 1) VAL [isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_17=0, var_1_18=0, var_1_19=2000000000001/2, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_26=0, var_1_27=4, var_1_28=0, var_1_29=129/2, var_1_30=79/8, var_1_31=128, var_1_32=1, var_1_33=128, var_1_34=10, var_1_7=1] [L113] CALL assume_abort_if_not(var_1_11 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_17=0, var_1_18=0, var_1_19=2000000000001/2, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_26=0, var_1_27=4, var_1_28=0, var_1_29=129/2, var_1_30=79/8, var_1_31=128, var_1_32=1, var_1_33=128, var_1_34=10, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_17=0, var_1_18=0, var_1_19=2000000000001/2, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_26=0, var_1_27=4, var_1_28=0, var_1_29=129/2, var_1_30=79/8, var_1_31=128, var_1_32=1, var_1_33=128, var_1_34=10, var_1_7=1] [L113] RET assume_abort_if_not(var_1_11 <= 1) VAL [isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_17=0, var_1_18=0, var_1_19=2000000000001/2, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_26=0, var_1_27=4, var_1_28=0, var_1_29=129/2, var_1_30=79/8, var_1_31=128, var_1_32=1, var_1_33=128, var_1_34=10, var_1_7=1] [L114] var_1_12 = __VERIFIER_nondet_uchar() [L115] CALL assume_abort_if_not(var_1_12 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_17=0, var_1_18=0, var_1_19=2000000000001/2, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_26=0, var_1_27=4, var_1_28=0, var_1_29=129/2, var_1_30=79/8, var_1_31=128, var_1_32=1, var_1_33=128, var_1_34=10, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_17=0, var_1_18=0, var_1_19=2000000000001/2, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_26=0, var_1_27=4, var_1_28=0, var_1_29=129/2, var_1_30=79/8, var_1_31=128, var_1_32=1, var_1_33=128, var_1_34=10, var_1_7=1] [L115] RET assume_abort_if_not(var_1_12 >= 1) VAL [isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_17=0, var_1_18=0, var_1_19=2000000000001/2, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_26=0, var_1_27=4, var_1_28=0, var_1_29=129/2, var_1_30=79/8, var_1_31=128, var_1_32=1, var_1_33=128, var_1_34=10, var_1_7=1] [L116] CALL assume_abort_if_not(var_1_12 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_17=0, var_1_18=0, var_1_19=2000000000001/2, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_26=0, var_1_27=4, var_1_28=0, var_1_29=129/2, var_1_30=79/8, var_1_31=128, var_1_32=1, var_1_33=128, var_1_34=10, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_17=0, var_1_18=0, var_1_19=2000000000001/2, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_26=0, var_1_27=4, var_1_28=0, var_1_29=129/2, var_1_30=79/8, var_1_31=128, var_1_32=1, var_1_33=128, var_1_34=10, var_1_7=1] [L116] RET assume_abort_if_not(var_1_12 <= 1) VAL [isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_17=0, var_1_18=0, var_1_19=2000000000001/2, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_26=0, var_1_27=4, var_1_28=0, var_1_29=129/2, var_1_30=79/8, var_1_31=128, var_1_32=1, var_1_33=128, var_1_34=10, var_1_7=1] [L117] var_1_13 = __VERIFIER_nondet_uchar() [L118] CALL assume_abort_if_not(var_1_13 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_17=0, var_1_18=0, var_1_19=2000000000001/2, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_26=0, var_1_27=4, var_1_28=0, var_1_29=129/2, var_1_30=79/8, var_1_31=128, var_1_32=1, var_1_33=128, var_1_34=10, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_17=0, var_1_18=0, var_1_19=2000000000001/2, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_26=0, var_1_27=4, var_1_28=0, var_1_29=129/2, var_1_30=79/8, var_1_31=128, var_1_32=1, var_1_33=128, var_1_34=10, var_1_7=1] [L118] RET assume_abort_if_not(var_1_13 >= 1) VAL [isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_17=0, var_1_18=0, var_1_19=2000000000001/2, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_26=0, var_1_27=4, var_1_28=0, var_1_29=129/2, var_1_30=79/8, var_1_31=128, var_1_32=1, var_1_33=128, var_1_34=10, var_1_7=1] [L119] CALL assume_abort_if_not(var_1_13 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_17=0, var_1_18=0, var_1_19=2000000000001/2, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_26=0, var_1_27=4, var_1_28=0, var_1_29=129/2, var_1_30=79/8, var_1_31=128, var_1_32=1, var_1_33=128, var_1_34=10, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_17=0, var_1_18=0, var_1_19=2000000000001/2, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_26=0, var_1_27=4, var_1_28=0, var_1_29=129/2, var_1_30=79/8, var_1_31=128, var_1_32=1, var_1_33=128, var_1_34=10, var_1_7=1] [L119] RET assume_abort_if_not(var_1_13 <= 1) VAL [isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_17=0, var_1_18=0, var_1_19=2000000000001/2, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_26=0, var_1_27=4, var_1_28=0, var_1_29=129/2, var_1_30=79/8, var_1_31=128, var_1_32=1, var_1_33=128, var_1_34=10, var_1_7=1] [L120] var_1_14 = __VERIFIER_nondet_uchar() [L121] CALL assume_abort_if_not(var_1_14 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_15=103/4, var_1_16=2/5, var_1_17=0, var_1_18=0, var_1_19=2000000000001/2, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_26=0, var_1_27=4, var_1_28=0, var_1_29=129/2, var_1_30=79/8, var_1_31=128, var_1_32=1, var_1_33=128, var_1_34=10, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_15=103/4, var_1_16=2/5, var_1_17=0, var_1_18=0, var_1_19=2000000000001/2, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_26=0, var_1_27=4, var_1_28=0, var_1_29=129/2, var_1_30=79/8, var_1_31=128, var_1_32=1, var_1_33=128, var_1_34=10, var_1_7=1] [L121] RET assume_abort_if_not(var_1_14 >= 0) VAL [isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_15=103/4, var_1_16=2/5, var_1_17=0, var_1_18=0, var_1_19=2000000000001/2, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_26=0, var_1_27=4, var_1_28=0, var_1_29=129/2, var_1_30=79/8, var_1_31=128, var_1_32=1, var_1_33=128, var_1_34=10, var_1_7=1] [L122] CALL assume_abort_if_not(var_1_14 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_17=0, var_1_18=0, var_1_19=2000000000001/2, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_26=0, var_1_27=4, var_1_28=0, var_1_29=129/2, var_1_30=79/8, var_1_31=128, var_1_32=1, var_1_33=128, var_1_34=10, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_17=0, var_1_18=0, var_1_19=2000000000001/2, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_26=0, var_1_27=4, var_1_28=0, var_1_29=129/2, var_1_30=79/8, var_1_31=128, var_1_32=1, var_1_33=128, var_1_34=10, var_1_7=1] [L122] RET assume_abort_if_not(var_1_14 <= 0) VAL [isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_17=0, var_1_18=0, var_1_19=2000000000001/2, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_26=0, var_1_27=4, var_1_28=0, var_1_29=129/2, var_1_30=79/8, var_1_31=128, var_1_32=1, var_1_33=128, var_1_34=10, var_1_7=1] [L123] var_1_17 = __VERIFIER_nondet_double() [L124] CALL assume_abort_if_not((var_1_17 >= 4611686.018427382800e+12F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 9223372.036854765600e+12F && var_1_17 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_18=0, var_1_19=2000000000001/2, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_26=0, var_1_27=4, var_1_28=0, var_1_29=129/2, var_1_30=79/8, var_1_31=128, var_1_32=1, var_1_33=128, var_1_34=10, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_18=0, var_1_19=2000000000001/2, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_26=0, var_1_27=4, var_1_28=0, var_1_29=129/2, var_1_30=79/8, var_1_31=128, var_1_32=1, var_1_33=128, var_1_34=10, var_1_7=1] [L124] RET assume_abort_if_not((var_1_17 >= 4611686.018427382800e+12F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 9223372.036854765600e+12F && var_1_17 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_18=0, var_1_19=2000000000001/2, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_26=0, var_1_27=4, var_1_28=0, var_1_29=129/2, var_1_30=79/8, var_1_31=128, var_1_32=1, var_1_33=128, var_1_34=10, var_1_7=1] [L125] var_1_18 = __VERIFIER_nondet_double() [L126] CALL assume_abort_if_not((var_1_18 >= 4611686.018427382800e+12F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 9223372.036854765600e+12F && var_1_18 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_19=2000000000001/2, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_26=0, var_1_27=4, var_1_28=0, var_1_29=129/2, var_1_30=79/8, var_1_31=128, var_1_32=1, var_1_33=128, var_1_34=10, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_19=2000000000001/2, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_26=0, var_1_27=4, var_1_28=0, var_1_29=129/2, var_1_30=79/8, var_1_31=128, var_1_32=1, var_1_33=128, var_1_34=10, var_1_7=1] [L126] RET assume_abort_if_not((var_1_18 >= 4611686.018427382800e+12F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 9223372.036854765600e+12F && var_1_18 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_19=2000000000001/2, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_26=0, var_1_27=4, var_1_28=0, var_1_29=129/2, var_1_30=79/8, var_1_31=128, var_1_32=1, var_1_33=128, var_1_34=10, var_1_7=1] [L127] var_1_19 = __VERIFIER_nondet_double() [L128] CALL assume_abort_if_not((var_1_19 >= 0.0F && var_1_19 <= -1.0e-20F) || (var_1_19 <= 4611686.018427382800e+12F && var_1_19 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_26=0, var_1_27=4, var_1_28=0, var_1_29=129/2, var_1_30=79/8, var_1_31=128, var_1_32=1, var_1_33=128, var_1_34=10, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_26=0, var_1_27=4, var_1_28=0, var_1_29=129/2, var_1_30=79/8, var_1_31=128, var_1_32=1, var_1_33=128, var_1_34=10, var_1_7=1] [L128] RET assume_abort_if_not((var_1_19 >= 0.0F && var_1_19 <= -1.0e-20F) || (var_1_19 <= 4611686.018427382800e+12F && var_1_19 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_26=0, var_1_27=4, var_1_28=0, var_1_29=129/2, var_1_30=79/8, var_1_31=128, var_1_32=1, var_1_33=128, var_1_34=10, var_1_7=1] [L129] var_1_20 = __VERIFIER_nondet_double() [L130] CALL assume_abort_if_not((var_1_20 >= 0.0F && var_1_20 <= -1.0e-20F) || (var_1_20 <= 9223372.036854765600e+12F && var_1_20 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_1=318/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_26=0, var_1_27=4, var_1_28=0, var_1_29=129/2, var_1_30=79/8, var_1_31=128, var_1_32=1, var_1_33=128, var_1_34=10, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_1=318/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_26=0, var_1_27=4, var_1_28=0, var_1_29=129/2, var_1_30=79/8, var_1_31=128, var_1_32=1, var_1_33=128, var_1_34=10, var_1_7=1] [L130] RET assume_abort_if_not((var_1_20 >= 0.0F && var_1_20 <= -1.0e-20F) || (var_1_20 <= 9223372.036854765600e+12F && var_1_20 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_1=318/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_26=0, var_1_27=4, var_1_28=0, var_1_29=129/2, var_1_30=79/8, var_1_31=128, var_1_32=1, var_1_33=128, var_1_34=10, var_1_7=1] [L131] var_1_23 = __VERIFIER_nondet_ushort() [L132] CALL assume_abort_if_not(var_1_23 >= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_1=318/5, var_1_21=1, var_1_22=1004/5, var_1_23=32767, var_1_24=8, var_1_25=2, var_1_26=0, var_1_27=4, var_1_28=0, var_1_29=129/2, var_1_30=79/8, var_1_31=128, var_1_32=1, var_1_33=128, var_1_34=10, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_1=318/5, var_1_21=1, var_1_22=1004/5, var_1_23=32767, var_1_24=8, var_1_25=2, var_1_26=0, var_1_27=4, var_1_28=0, var_1_29=129/2, var_1_30=79/8, var_1_31=128, var_1_32=1, var_1_33=128, var_1_34=10, var_1_7=1] [L132] RET assume_abort_if_not(var_1_23 >= 32767) VAL [isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_1=318/5, var_1_21=1, var_1_22=1004/5, var_1_23=32767, var_1_24=8, var_1_25=2, var_1_26=0, var_1_27=4, var_1_28=0, var_1_29=129/2, var_1_30=79/8, var_1_31=128, var_1_32=1, var_1_33=128, var_1_34=10, var_1_7=1] [L133] CALL assume_abort_if_not(var_1_23 <= 65535) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_1=318/5, var_1_21=1, var_1_22=1004/5, var_1_23=32767, var_1_24=8, var_1_25=2, var_1_26=0, var_1_27=4, var_1_28=0, var_1_29=129/2, var_1_30=79/8, var_1_31=128, var_1_32=1, var_1_33=128, var_1_34=10, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_1=318/5, var_1_21=1, var_1_22=1004/5, var_1_23=32767, var_1_24=8, var_1_25=2, var_1_26=0, var_1_27=4, var_1_28=0, var_1_29=129/2, var_1_30=79/8, var_1_31=128, var_1_32=1, var_1_33=128, var_1_34=10, var_1_7=1] [L133] RET assume_abort_if_not(var_1_23 <= 65535) VAL [isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_1=318/5, var_1_21=1, var_1_22=1004/5, var_1_23=32767, var_1_24=8, var_1_25=2, var_1_26=0, var_1_27=4, var_1_28=0, var_1_29=129/2, var_1_30=79/8, var_1_31=128, var_1_32=1, var_1_33=128, var_1_34=10, var_1_7=1] [L134] var_1_24 = __VERIFIER_nondet_ushort() [L135] CALL assume_abort_if_not(var_1_24 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_1=318/5, var_1_21=1, var_1_22=1004/5, var_1_23=32767, var_1_25=2, var_1_26=0, var_1_27=4, var_1_28=0, var_1_29=129/2, var_1_30=79/8, var_1_31=128, var_1_32=1, var_1_33=128, var_1_34=10, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_1=318/5, var_1_21=1, var_1_22=1004/5, var_1_23=32767, var_1_25=2, var_1_26=0, var_1_27=4, var_1_28=0, var_1_29=129/2, var_1_30=79/8, var_1_31=128, var_1_32=1, var_1_33=128, var_1_34=10, var_1_7=1] [L135] RET assume_abort_if_not(var_1_24 >= 0) VAL [isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_1=318/5, var_1_21=1, var_1_22=1004/5, var_1_23=32767, var_1_25=2, var_1_26=0, var_1_27=4, var_1_28=0, var_1_29=129/2, var_1_30=79/8, var_1_31=128, var_1_32=1, var_1_33=128, var_1_34=10, var_1_7=1] [L136] CALL assume_abort_if_not(var_1_24 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_1=318/5, var_1_21=1, var_1_22=1004/5, var_1_23=32767, var_1_24=0, var_1_25=2, var_1_26=0, var_1_27=4, var_1_28=0, var_1_29=129/2, var_1_30=79/8, var_1_31=128, var_1_32=1, var_1_33=128, var_1_34=10, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_1=318/5, var_1_21=1, var_1_22=1004/5, var_1_23=32767, var_1_24=0, var_1_25=2, var_1_26=0, var_1_27=4, var_1_28=0, var_1_29=129/2, var_1_30=79/8, var_1_31=128, var_1_32=1, var_1_33=128, var_1_34=10, var_1_7=1] [L136] RET assume_abort_if_not(var_1_24 <= 32767) VAL [isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_1=318/5, var_1_21=1, var_1_22=1004/5, var_1_23=32767, var_1_24=0, var_1_25=2, var_1_26=0, var_1_27=4, var_1_28=0, var_1_29=129/2, var_1_30=79/8, var_1_31=128, var_1_32=1, var_1_33=128, var_1_34=10, var_1_7=1] [L137] var_1_28 = __VERIFIER_nondet_char() [L138] CALL assume_abort_if_not(var_1_28 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_1=318/5, var_1_21=1, var_1_22=1004/5, var_1_23=32767, var_1_24=0, var_1_25=2, var_1_26=0, var_1_27=4, var_1_28=-127, var_1_29=129/2, var_1_30=79/8, var_1_31=128, var_1_32=1, var_1_33=128, var_1_34=10, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_1=318/5, var_1_21=1, var_1_22=1004/5, var_1_23=32767, var_1_24=0, var_1_25=2, var_1_26=0, var_1_27=4, var_1_28=-127, var_1_29=129/2, var_1_30=79/8, var_1_31=128, var_1_32=1, var_1_33=128, var_1_34=10, var_1_7=1] [L138] RET assume_abort_if_not(var_1_28 >= -127) VAL [isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_1=318/5, var_1_21=1, var_1_22=1004/5, var_1_23=32767, var_1_24=0, var_1_25=2, var_1_26=0, var_1_27=4, var_1_28=-127, var_1_29=129/2, var_1_30=79/8, var_1_31=128, var_1_32=1, var_1_33=128, var_1_34=10, var_1_7=1] [L139] CALL assume_abort_if_not(var_1_28 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_1=318/5, var_1_21=1, var_1_22=1004/5, var_1_23=32767, var_1_24=0, var_1_25=2, var_1_26=0, var_1_27=4, var_1_28=-127, var_1_29=129/2, var_1_30=79/8, var_1_31=128, var_1_32=1, var_1_33=128, var_1_34=10, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_1=318/5, var_1_21=1, var_1_22=1004/5, var_1_23=32767, var_1_24=0, var_1_25=2, var_1_26=0, var_1_27=4, var_1_28=-127, var_1_29=129/2, var_1_30=79/8, var_1_31=128, var_1_32=1, var_1_33=128, var_1_34=10, var_1_7=1] [L139] RET assume_abort_if_not(var_1_28 <= 126) VAL [isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_1=318/5, var_1_21=1, var_1_22=1004/5, var_1_23=32767, var_1_24=0, var_1_25=2, var_1_26=0, var_1_27=4, var_1_28=-127, var_1_29=129/2, var_1_30=79/8, var_1_31=128, var_1_32=1, var_1_33=128, var_1_34=10, var_1_7=1] [L140] var_1_30 = __VERIFIER_nondet_double() [L141] CALL assume_abort_if_not((var_1_30 >= -922337.2036854765600e+13F && var_1_30 <= -1.0e-20F) || (var_1_30 <= 9223372.036854765600e+12F && var_1_30 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_1=318/5, var_1_21=1, var_1_22=1004/5, var_1_23=32767, var_1_24=0, var_1_25=2, var_1_26=0, var_1_27=4, var_1_28=-127, var_1_29=129/2, var_1_31=128, var_1_32=1, var_1_33=128, var_1_34=10, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_1=318/5, var_1_21=1, var_1_22=1004/5, var_1_23=32767, var_1_24=0, var_1_25=2, var_1_26=0, var_1_27=4, var_1_28=-127, var_1_29=129/2, var_1_31=128, var_1_32=1, var_1_33=128, var_1_34=10, var_1_7=1] [L141] RET assume_abort_if_not((var_1_30 >= -922337.2036854765600e+13F && var_1_30 <= -1.0e-20F) || (var_1_30 <= 9223372.036854765600e+12F && var_1_30 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_1=318/5, var_1_21=1, var_1_22=1004/5, var_1_23=32767, var_1_24=0, var_1_25=2, var_1_26=0, var_1_27=4, var_1_28=-127, var_1_29=129/2, var_1_31=128, var_1_32=1, var_1_33=128, var_1_34=10, var_1_7=1] [L142] var_1_32 = __VERIFIER_nondet_ushort() [L143] CALL assume_abort_if_not(var_1_32 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_1=318/5, var_1_21=1, var_1_22=1004/5, var_1_23=32767, var_1_24=0, var_1_25=2, var_1_26=0, var_1_27=4, var_1_28=-127, var_1_29=129/2, var_1_31=128, var_1_33=128, var_1_34=10, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_1=318/5, var_1_21=1, var_1_22=1004/5, var_1_23=32767, var_1_24=0, var_1_25=2, var_1_26=0, var_1_27=4, var_1_28=-127, var_1_29=129/2, var_1_31=128, var_1_33=128, var_1_34=10, var_1_7=1] [L143] RET assume_abort_if_not(var_1_32 >= 0) VAL [isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_1=318/5, var_1_21=1, var_1_22=1004/5, var_1_23=32767, var_1_24=0, var_1_25=2, var_1_26=0, var_1_27=4, var_1_28=-127, var_1_29=129/2, var_1_31=128, var_1_33=128, var_1_34=10, var_1_7=1] [L144] CALL assume_abort_if_not(var_1_32 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_1=318/5, var_1_21=1, var_1_22=1004/5, var_1_23=32767, var_1_24=0, var_1_25=2, var_1_26=0, var_1_27=4, var_1_28=-127, var_1_29=129/2, var_1_31=128, var_1_32=65534, var_1_33=128, var_1_34=10, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_1=318/5, var_1_21=1, var_1_22=1004/5, var_1_23=32767, var_1_24=0, var_1_25=2, var_1_26=0, var_1_27=4, var_1_28=-127, var_1_29=129/2, var_1_31=128, var_1_32=65534, var_1_33=128, var_1_34=10, var_1_7=1] [L144] RET assume_abort_if_not(var_1_32 <= 65534) VAL [isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_1=318/5, var_1_21=1, var_1_22=1004/5, var_1_23=32767, var_1_24=0, var_1_25=2, var_1_26=0, var_1_27=4, var_1_28=-127, var_1_29=129/2, var_1_31=128, var_1_32=65534, var_1_33=128, var_1_34=10, var_1_7=1] [L145] var_1_34 = __VERIFIER_nondet_uchar() [L146] CALL assume_abort_if_not(var_1_34 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_1=318/5, var_1_21=1, var_1_22=1004/5, var_1_23=32767, var_1_24=0, var_1_25=2, var_1_26=0, var_1_27=4, var_1_28=-127, var_1_29=129/2, var_1_31=128, var_1_32=65534, var_1_33=128, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_1=318/5, var_1_21=1, var_1_22=1004/5, var_1_23=32767, var_1_24=0, var_1_25=2, var_1_26=0, var_1_27=4, var_1_28=-127, var_1_29=129/2, var_1_31=128, var_1_32=65534, var_1_33=128, var_1_7=1] [L146] RET assume_abort_if_not(var_1_34 >= 0) VAL [isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_1=318/5, var_1_21=1, var_1_22=1004/5, var_1_23=32767, var_1_24=0, var_1_25=2, var_1_26=0, var_1_27=4, var_1_28=-127, var_1_29=129/2, var_1_31=128, var_1_32=65534, var_1_33=128, var_1_7=1] [L147] CALL assume_abort_if_not(var_1_34 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_1=318/5, var_1_21=1, var_1_22=1004/5, var_1_23=32767, var_1_24=0, var_1_25=2, var_1_26=0, var_1_27=4, var_1_28=-127, var_1_29=129/2, var_1_31=128, var_1_32=65534, var_1_33=128, var_1_34=0, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_1=318/5, var_1_21=1, var_1_22=1004/5, var_1_23=32767, var_1_24=0, var_1_25=2, var_1_26=0, var_1_27=4, var_1_28=-127, var_1_29=129/2, var_1_31=128, var_1_32=65534, var_1_33=128, var_1_34=0, var_1_7=1] [L147] RET assume_abort_if_not(var_1_34 <= 254) VAL [isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_1=318/5, var_1_21=1, var_1_22=1004/5, var_1_23=32767, var_1_24=0, var_1_25=2, var_1_26=0, var_1_27=4, var_1_28=-127, var_1_29=129/2, var_1_31=128, var_1_32=65534, var_1_33=128, var_1_34=0, var_1_7=1] [L161] RET updateVariables() [L162] CALL step() [L55] var_1_26 = 0 [L56] var_1_27 = var_1_28 [L57] var_1_29 = var_1_30 [L58] var_1_31 = var_1_32 VAL [isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_1=318/5, var_1_21=1, var_1_22=1004/5, var_1_23=32767, var_1_24=0, var_1_25=2, var_1_26=0, var_1_27=-127, var_1_28=-127, var_1_29=1000000000005, var_1_30=1000000000005, var_1_31=65534, var_1_32=65534, var_1_33=128, var_1_34=0, var_1_7=1] [L59] COND TRUE var_1_31 >= var_1_32 VAL [isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_1=318/5, var_1_21=1, var_1_22=1004/5, var_1_23=32767, var_1_24=0, var_1_25=2, var_1_26=0, var_1_27=-127, var_1_28=-127, var_1_29=1000000000005, var_1_30=1000000000005, var_1_31=65534, var_1_32=65534, var_1_33=128, var_1_34=0, var_1_7=1] [L60] COND FALSE !(((((var_1_31) > (16)) ? (var_1_31) : (16))) < var_1_32) VAL [isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_1=318/5, var_1_21=1, var_1_22=1004/5, var_1_23=32767, var_1_24=0, var_1_25=2, var_1_26=0, var_1_27=-127, var_1_28=-127, var_1_29=1000000000005, var_1_30=1000000000005, var_1_31=65534, var_1_32=65534, var_1_33=128, var_1_34=0, var_1_7=1] [L64] COND TRUE ! (var_1_4 < 16.8f) [L65] var_1_15 = var_1_6 VAL [isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=1000000000006, var_1_16=2/5, var_1_1=318/5, var_1_21=1, var_1_22=1004/5, var_1_23=32767, var_1_24=0, var_1_25=2, var_1_26=0, var_1_27=-127, var_1_28=-127, var_1_29=1000000000005, var_1_30=1000000000005, var_1_31=65534, var_1_32=65534, var_1_33=128, var_1_34=0, var_1_6=1000000000006, var_1_7=1] [L67] var_1_25 = var_1_23 VAL [isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=1000000000006, var_1_16=2/5, var_1_1=318/5, var_1_21=1, var_1_22=1004/5, var_1_23=32767, var_1_24=0, var_1_25=32767, var_1_26=0, var_1_27=-127, var_1_28=-127, var_1_29=1000000000005, var_1_30=1000000000005, var_1_31=65534, var_1_32=65534, var_1_33=128, var_1_34=0, var_1_6=1000000000006, var_1_7=1] [L68] EXPR 4 | var_1_25 VAL [isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=1000000000006, var_1_16=2/5, var_1_1=318/5, var_1_21=1, var_1_22=1004/5, var_1_23=32767, var_1_24=0, var_1_25=32767, var_1_26=0, var_1_27=-127, var_1_28=-127, var_1_29=1000000000005, var_1_30=1000000000005, var_1_31=65534, var_1_32=65534, var_1_33=128, var_1_34=0, var_1_6=1000000000006, var_1_7=1] [L68] EXPR (((var_1_25 + var_1_25)) < ((4 | var_1_25))) ? ((var_1_25 + var_1_25)) : ((4 | var_1_25)) VAL [isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=1000000000006, var_1_16=2/5, var_1_1=318/5, var_1_21=1, var_1_22=1004/5, var_1_23=32767, var_1_24=0, var_1_25=32767, var_1_26=0, var_1_27=-127, var_1_28=-127, var_1_29=1000000000005, var_1_30=1000000000005, var_1_31=65534, var_1_32=65534, var_1_33=128, var_1_34=0, var_1_6=1000000000006, var_1_7=1] [L68] EXPR 4 | var_1_25 VAL [isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=1000000000006, var_1_16=2/5, var_1_1=318/5, var_1_21=1, var_1_22=1004/5, var_1_23=32767, var_1_24=0, var_1_25=32767, var_1_26=0, var_1_27=-127, var_1_28=-127, var_1_29=1000000000005, var_1_30=1000000000005, var_1_31=65534, var_1_32=65534, var_1_33=128, var_1_34=0, var_1_6=1000000000006, var_1_7=1] [L68] EXPR (((var_1_25 + var_1_25)) < ((4 | var_1_25))) ? ((var_1_25 + var_1_25)) : ((4 | var_1_25)) VAL [isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=1000000000006, var_1_16=2/5, var_1_1=318/5, var_1_21=1, var_1_22=1004/5, var_1_23=32767, var_1_24=0, var_1_25=32767, var_1_26=0, var_1_27=-127, var_1_28=-127, var_1_29=1000000000005, var_1_30=1000000000005, var_1_31=65534, var_1_32=65534, var_1_33=128, var_1_34=0, var_1_6=1000000000006, var_1_7=1] [L68] COND TRUE (((((var_1_25 + var_1_25)) < ((4 | var_1_25))) ? ((var_1_25 + var_1_25)) : ((4 | var_1_25)))) >= var_1_25 [L69] var_1_7 = ((var_1_11 && var_1_12) && var_1_13) VAL [isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=1000000000006, var_1_16=2/5, var_1_1=318/5, var_1_21=1, var_1_22=1004/5, var_1_23=32767, var_1_24=0, var_1_25=32767, var_1_26=0, var_1_27=-127, var_1_28=-127, var_1_29=1000000000005, var_1_30=1000000000005, var_1_31=65534, var_1_32=65534, var_1_33=128, var_1_34=0, var_1_6=1000000000006, var_1_7=1] [L77] COND FALSE !(var_1_25 > var_1_25) VAL [isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=1000000000006, var_1_16=2/5, var_1_1=318/5, var_1_21=1, var_1_22=1004/5, var_1_23=32767, var_1_24=0, var_1_25=32767, var_1_26=0, var_1_27=-127, var_1_28=-127, var_1_29=1000000000005, var_1_30=1000000000005, var_1_31=65534, var_1_32=65534, var_1_33=128, var_1_34=0, var_1_6=1000000000006, var_1_7=1] [L80] COND TRUE var_1_18 > (var_1_20 + (var_1_19 * var_1_17)) [L81] var_1_16 = var_1_6 VAL [isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=1000000000006, var_1_16=1000000000006, var_1_1=318/5, var_1_21=1, var_1_22=1004/5, var_1_23=32767, var_1_24=0, var_1_25=32767, var_1_26=0, var_1_27=-127, var_1_28=-127, var_1_29=1000000000005, var_1_30=1000000000005, var_1_31=65534, var_1_32=65534, var_1_33=128, var_1_34=0, var_1_6=1000000000006, var_1_7=1] [L86] unsigned long int stepLocal_1 = var_1_25; VAL [isInitial=1, last_1_var_1_22=1004/5, stepLocal_1=32767, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=1000000000006, var_1_16=1000000000006, var_1_1=318/5, var_1_21=1, var_1_22=1004/5, var_1_23=32767, var_1_24=0, var_1_25=32767, var_1_26=0, var_1_27=-127, var_1_28=-127, var_1_29=1000000000005, var_1_30=1000000000005, var_1_31=65534, var_1_32=65534, var_1_33=128, var_1_34=0, var_1_6=1000000000006, var_1_7=1] [L87] COND FALSE !(var_1_18 < (last_1_var_1_22 * var_1_4)) [L94] var_1_22 = var_1_20 VAL [isInitial=1, last_1_var_1_22=1004/5, stepLocal_1=32767, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=1000000000006, var_1_16=1000000000006, var_1_1=318/5, var_1_20=1000000000007, var_1_21=1, var_1_22=1000000000007, var_1_23=32767, var_1_24=0, var_1_25=32767, var_1_26=0, var_1_27=-127, var_1_28=-127, var_1_29=1000000000005, var_1_30=1000000000005, var_1_31=65534, var_1_32=65534, var_1_33=128, var_1_34=0, var_1_6=1000000000006, var_1_7=1] [L96] unsigned char stepLocal_0 = -1 <= var_1_25; VAL [isInitial=1, last_1_var_1_22=1004/5, stepLocal_0=0, stepLocal_1=32767, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=1000000000006, var_1_16=1000000000006, var_1_1=318/5, var_1_20=1000000000007, var_1_21=1, var_1_22=1000000000007, var_1_23=32767, var_1_24=0, var_1_25=32767, var_1_26=0, var_1_27=-127, var_1_28=-127, var_1_29=1000000000005, var_1_30=1000000000005, var_1_31=65534, var_1_32=65534, var_1_33=128, var_1_34=0, var_1_6=1000000000006, var_1_7=1] [L97] COND TRUE stepLocal_0 || var_1_7 [L98] var_1_1 = (var_1_4 + (var_1_5 + var_1_6)) VAL [isInitial=1, last_1_var_1_22=1004/5, stepLocal_1=32767, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=1000000000006, var_1_16=1000000000006, var_1_20=1000000000007, var_1_21=1, var_1_22=1000000000007, var_1_23=32767, var_1_24=0, var_1_25=32767, var_1_26=0, var_1_27=-127, var_1_28=-127, var_1_29=1000000000005, var_1_30=1000000000005, var_1_31=65534, var_1_32=65534, var_1_33=128, var_1_34=0, var_1_6=1000000000006, var_1_7=1] [L100] COND TRUE (- (var_1_17 + var_1_1)) >= var_1_16 [L101] var_1_21 = ((((-50) < 0 ) ? -(-50) : (-50))) VAL [isInitial=1, last_1_var_1_22=1004/5, stepLocal_1=32767, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=1000000000006, var_1_16=1000000000006, var_1_20=1000000000007, var_1_21=50, var_1_22=1000000000007, var_1_23=32767, var_1_24=0, var_1_25=32767, var_1_26=0, var_1_27=-127, var_1_28=-127, var_1_29=1000000000005, var_1_30=1000000000005, var_1_31=65534, var_1_32=65534, var_1_33=128, var_1_34=0, var_1_6=1000000000006, var_1_7=1] [L162] RET step() [L163] CALL, EXPR property() [L153] EXPR (((-1 <= var_1_25) || var_1_7) ? (var_1_1 == ((float) (var_1_4 + (var_1_5 + var_1_6)))) : 1) && (((((((var_1_25 + var_1_25)) < ((4 | var_1_25))) ? ((var_1_25 + var_1_25)) : ((4 | var_1_25)))) >= var_1_25) ? (var_1_7 == ((unsigned char) ((var_1_11 && var_1_12) && var_1_13))) : ((var_1_6 == var_1_15) ? (var_1_7 == ((unsigned char) var_1_14)) : (var_1_7 == ((unsigned char) var_1_13)))) VAL [isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=1000000000006, var_1_16=1000000000006, var_1_20=1000000000007, var_1_21=50, var_1_22=1000000000007, var_1_23=32767, var_1_24=0, var_1_25=32767, var_1_26=0, var_1_27=-127, var_1_28=-127, var_1_29=1000000000005, var_1_30=1000000000005, var_1_31=65534, var_1_32=65534, var_1_33=128, var_1_34=0, var_1_6=1000000000006, var_1_7=1] [L153-L154] return ((((((((-1 <= var_1_25) || var_1_7) ? (var_1_1 == ((float) (var_1_4 + (var_1_5 + var_1_6)))) : 1) && (((((((var_1_25 + var_1_25)) < ((4 | var_1_25))) ? ((var_1_25 + var_1_25)) : ((4 | var_1_25)))) >= var_1_25) ? (var_1_7 == ((unsigned char) ((var_1_11 && var_1_12) && var_1_13))) : ((var_1_6 == var_1_15) ? (var_1_7 == ((unsigned char) var_1_14)) : (var_1_7 == ((unsigned char) var_1_13))))) && ((! (var_1_4 < 16.8f)) ? (var_1_15 == ((float) var_1_6)) : 1)) && ((var_1_25 > var_1_25) ? (var_1_16 == ((double) ((((((var_1_17) < (var_1_18)) ? (var_1_17) : (var_1_18))) - var_1_19) - var_1_20))) : ((var_1_18 > (var_1_20 + (var_1_19 * var_1_17))) ? (var_1_16 == ((double) var_1_6)) : (var_1_16 == ((double) var_1_20))))) && (((- (var_1_17 + var_1_1)) >= var_1_16) ? (var_1_21 == ((signed char) ((((-50) < 0 ) ? -(-50) : (-50))))) : 1)) && ((var_1_18 < (last_1_var_1_22 * var_1_4)) ? (((var_1_23 - var_1_24) < var_1_25) ? (var_1_22 == ((double) var_1_5)) : (var_1_22 == ((double) var_1_17))) : (var_1_22 == ((double) var_1_20)))) && (var_1_25 == ((unsigned long int) var_1_23)) ; [L163] RET, EXPR property() [L163] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=1000000000006, var_1_16=1000000000006, var_1_20=1000000000007, var_1_21=50, var_1_22=1000000000007, var_1_23=32767, var_1_24=0, var_1_25=32767, var_1_26=0, var_1_27=-127, var_1_28=-127, var_1_29=1000000000005, var_1_30=1000000000005, var_1_31=65534, var_1_32=65534, var_1_33=128, var_1_34=0, var_1_6=1000000000006, var_1_7=1] [L19] reach_error() VAL [isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=1000000000006, var_1_16=1000000000006, var_1_20=1000000000007, var_1_21=50, var_1_22=1000000000007, var_1_23=32767, var_1_24=0, var_1_25=32767, var_1_26=0, var_1_27=-127, var_1_28=-127, var_1_29=1000000000005, var_1_30=1000000000005, var_1_31=65534, var_1_32=65534, var_1_33=128, var_1_34=0, var_1_6=1000000000006, var_1_7=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 98 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 6.7s, OverallIterations: 6, TraceHistogramMax: 26, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 1.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 677 SdHoareTripleChecker+Valid, 1.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 659 mSDsluCounter, 1504 SdHoareTripleChecker+Invalid, 1.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 848 mSDsCounter, 337 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1215 IncrementalHoareTripleChecker+Invalid, 1552 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 337 mSolverCounterUnsat, 656 mSDtfsCounter, 1215 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1033 GetRequests, 987 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 130 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=101occurred in iteration=4, InterpolantAutomatonStates: 40, 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, 5 MinimizatonAttempts, 140 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 2.9s InterpolantComputationTime, 1401 NumberOfCodeBlocks, 1401 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 1563 ConstructedInterpolants, 0 QuantifiedInterpolants, 2686 SizeOfPredicates, 3 NumberOfNonLiveVariables, 796 ConjunctsInSsa, 20 ConjunctsInUnsatCore, 9 InterpolantComputations, 3 PerfectInterpolantSequences, 11520/11700 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-10 04:08:56,153 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-75.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 01255a2de244ad5f0e2f4316c1d9bc147d3be1eb9af8b3b357be1318db919a62 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 04:08:58,442 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 04:08:58,536 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-10 04:08:58,543 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 04:08:58,544 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 04:08:58,576 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 04:08:58,578 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 04:08:58,578 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 04:08:58,579 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 04:08:58,580 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 04:08:58,581 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 04:08:58,581 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 04:08:58,582 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 04:08:58,582 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 04:08:58,583 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 04:08:58,583 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 04:08:58,583 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 04:08:58,584 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 04:08:58,586 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 04:08:58,587 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 04:08:58,587 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 04:08:58,588 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 04:08:58,588 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 04:08:58,588 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-10 04:08:58,589 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-10 04:08:58,589 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 04:08:58,589 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-10 04:08:58,589 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 04:08:58,590 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 04:08:58,590 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 04:08:58,590 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 04:08:58,591 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 04:08:58,591 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 04:08:58,594 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 04:08:58,595 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 04:08:58,595 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 04:08:58,595 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 04:08:58,595 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 04:08:58,596 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-10 04:08:58,596 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-10 04:08:58,596 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 04:08:58,596 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 04:08:58,597 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 04:08:58,597 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 04:08:58,597 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 -> 01255a2de244ad5f0e2f4316c1d9bc147d3be1eb9af8b3b357be1318db919a62 [2024-11-10 04:08:58,925 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 04:08:58,948 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 04:08:58,951 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 04:08:58,952 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 04:08:58,953 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 04:08:58,954 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-75.i [2024-11-10 04:09:00,544 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 04:09:00,796 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 04:09:00,797 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-75.i [2024-11-10 04:09:00,807 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dd6988a12/491412ac397941eebe8d3deb8f713bda/FLAG0312c15b0 [2024-11-10 04:09:01,147 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dd6988a12/491412ac397941eebe8d3deb8f713bda [2024-11-10 04:09:01,149 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 04:09:01,150 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 04:09:01,151 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 04:09:01,151 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 04:09:01,158 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 04:09:01,159 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 04:09:01" (1/1) ... [2024-11-10 04:09:01,160 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3855507f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:09:01, skipping insertion in model container [2024-11-10 04:09:01,161 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 04:09:01" (1/1) ... [2024-11-10 04:09:01,188 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 04:09:01,390 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-75.i[915,928] [2024-11-10 04:09:01,476 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 04:09:01,495 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 04:09:01,513 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-75.i[915,928] [2024-11-10 04:09:01,556 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 04:09:01,583 INFO L204 MainTranslator]: Completed translation [2024-11-10 04:09:01,584 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:09:01 WrapperNode [2024-11-10 04:09:01,584 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 04:09:01,585 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 04:09:01,585 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 04:09:01,586 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 04:09:01,592 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:09:01" (1/1) ... [2024-11-10 04:09:01,607 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:09:01" (1/1) ... [2024-11-10 04:09:01,648 INFO L138 Inliner]: procedures = 27, calls = 39, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 172 [2024-11-10 04:09:01,652 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 04:09:01,653 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 04:09:01,653 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 04:09:01,654 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 04:09:01,664 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:09:01" (1/1) ... [2024-11-10 04:09:01,665 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:09:01" (1/1) ... [2024-11-10 04:09:01,669 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:09:01" (1/1) ... [2024-11-10 04:09:01,692 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-10 04:09:01,692 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:09:01" (1/1) ... [2024-11-10 04:09:01,693 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:09:01" (1/1) ... [2024-11-10 04:09:01,706 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:09:01" (1/1) ... [2024-11-10 04:09:01,707 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:09:01" (1/1) ... [2024-11-10 04:09:01,709 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:09:01" (1/1) ... [2024-11-10 04:09:01,711 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:09:01" (1/1) ... [2024-11-10 04:09:01,714 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 04:09:01,715 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 04:09:01,716 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 04:09:01,716 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 04:09:01,717 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:09:01" (1/1) ... [2024-11-10 04:09:01,722 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 04:09:01,742 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 04:09:01,757 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-10 04:09:01,760 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-10 04:09:01,803 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 04:09:01,803 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-10 04:09:01,803 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-10 04:09:01,803 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-10 04:09:01,803 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 04:09:01,803 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 04:09:01,883 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 04:09:01,885 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 04:09:20,924 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2024-11-10 04:09:20,925 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 04:09:20,939 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 04:09:20,939 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 04:09:20,940 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 04:09:20 BoogieIcfgContainer [2024-11-10 04:09:20,940 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 04:09:20,943 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 04:09:20,944 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 04:09:20,947 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 04:09:20,947 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 04:09:01" (1/3) ... [2024-11-10 04:09:20,948 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@593ae521 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 04:09:20, skipping insertion in model container [2024-11-10 04:09:20,948 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:09:01" (2/3) ... [2024-11-10 04:09:20,948 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@593ae521 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 04:09:20, skipping insertion in model container [2024-11-10 04:09:20,948 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 04:09:20" (3/3) ... [2024-11-10 04:09:20,950 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-10_file-75.i [2024-11-10 04:09:20,963 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 04:09:20,963 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-10 04:09:21,028 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 04:09:21,035 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;@2ec5d71d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 04:09:21,035 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-10 04:09:21,040 INFO L276 IsEmpty]: Start isEmpty. Operand has 79 states, 50 states have (on average 1.32) internal successors, (66), 51 states have internal predecessors, (66), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-10 04:09:21,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2024-11-10 04:09:21,060 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 04:09:21,061 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 04:09:21,061 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 04:09:21,066 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 04:09:21,067 INFO L85 PathProgramCache]: Analyzing trace with hash -93492539, now seen corresponding path program 1 times [2024-11-10 04:09:21,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 04:09:21,084 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2022138719] [2024-11-10 04:09:21,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 04:09:21,085 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 04:09:21,085 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 04:09:21,089 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 04:09:21,091 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-10 04:09:21,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:09:21,825 INFO L255 TraceCheckSpWp]: Trace formula consists of 273 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-10 04:09:21,837 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 04:09:21,895 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 666 proven. 0 refuted. 0 times theorem prover too weak. 634 trivial. 0 not checked. [2024-11-10 04:09:21,895 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 04:09:21,897 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 04:09:21,897 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2022138719] [2024-11-10 04:09:21,898 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2022138719] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 04:09:21,898 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 04:09:21,899 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 04:09:21,901 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [366109244] [2024-11-10 04:09:21,901 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 04:09:21,906 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-10 04:09:21,907 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 04:09:21,934 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-10 04:09:21,934 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 04:09:21,937 INFO L87 Difference]: Start difference. First operand has 79 states, 50 states have (on average 1.32) internal successors, (66), 51 states have internal predecessors, (66), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) Second operand has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2024-11-10 04:09:21,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 04:09:21,973 INFO L93 Difference]: Finished difference Result 150 states and 255 transitions. [2024-11-10 04:09:21,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-10 04:09:21,976 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) Word has length 168 [2024-11-10 04:09:21,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 04:09:21,982 INFO L225 Difference]: With dead ends: 150 [2024-11-10 04:09:21,982 INFO L226 Difference]: Without dead ends: 74 [2024-11-10 04:09:21,985 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 167 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 04:09:21,989 INFO L432 NwaCegarLoop]: 109 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 109 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 04:09:21,990 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 04:09:22,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2024-11-10 04:09:22,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2024-11-10 04:09:22,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 46 states have (on average 1.2391304347826086) internal successors, (57), 46 states have internal predecessors, (57), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-10 04:09:22,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 109 transitions. [2024-11-10 04:09:22,038 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 109 transitions. Word has length 168 [2024-11-10 04:09:22,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 04:09:22,038 INFO L471 AbstractCegarLoop]: Abstraction has 74 states and 109 transitions. [2024-11-10 04:09:22,039 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2024-11-10 04:09:22,039 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 109 transitions. [2024-11-10 04:09:22,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2024-11-10 04:09:22,042 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 04:09:22,042 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 04:09:22,065 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-10 04:09:22,243 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 04:09:22,244 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 04:09:22,244 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 04:09:22,245 INFO L85 PathProgramCache]: Analyzing trace with hash 423986567, now seen corresponding path program 1 times [2024-11-10 04:09:22,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 04:09:22,246 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [627591706] [2024-11-10 04:09:22,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 04:09:22,246 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 04:09:22,246 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 04:09:22,250 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 04:09:22,251 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-10 04:09:22,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:09:22,889 INFO L255 TraceCheckSpWp]: Trace formula consists of 275 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-10 04:09:22,896 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 04:09:23,024 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-11-10 04:09:23,024 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 04:09:23,025 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 04:09:23,025 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [627591706] [2024-11-10 04:09:23,025 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [627591706] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 04:09:23,025 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 04:09:23,027 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 04:09:23,027 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2014606866] [2024-11-10 04:09:23,028 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 04:09:23,030 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 04:09:23,031 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 04:09:23,043 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 04:09:23,044 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 04:09:23,045 INFO L87 Difference]: Start difference. First operand 74 states and 109 transitions. Second operand has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-10 04:09:23,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 04:09:23,186 INFO L93 Difference]: Finished difference Result 189 states and 280 transitions. [2024-11-10 04:09:23,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 04:09:23,189 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 169 [2024-11-10 04:09:23,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 04:09:23,192 INFO L225 Difference]: With dead ends: 189 [2024-11-10 04:09:23,195 INFO L226 Difference]: Without dead ends: 118 [2024-11-10 04:09:23,197 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 167 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 04:09:23,198 INFO L432 NwaCegarLoop]: 170 mSDtfsCounter, 93 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 243 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 04:09:23,200 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 243 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 04:09:23,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2024-11-10 04:09:23,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 117. [2024-11-10 04:09:23,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 66 states have (on average 1.1363636363636365) internal successors, (75), 67 states have internal predecessors, (75), 48 states have call successors, (48), 2 states have call predecessors, (48), 2 states have return successors, (48), 47 states have call predecessors, (48), 48 states have call successors, (48) [2024-11-10 04:09:23,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 171 transitions. [2024-11-10 04:09:23,238 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 171 transitions. Word has length 169 [2024-11-10 04:09:23,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 04:09:23,239 INFO L471 AbstractCegarLoop]: Abstraction has 117 states and 171 transitions. [2024-11-10 04:09:23,239 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-10 04:09:23,240 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 171 transitions. [2024-11-10 04:09:23,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2024-11-10 04:09:23,245 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 04:09:23,245 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 04:09:23,273 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 (3)] Ended with exit code 0 [2024-11-10 04:09:23,446 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 04:09:23,447 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 04:09:23,447 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 04:09:23,448 INFO L85 PathProgramCache]: Analyzing trace with hash 1295655482, now seen corresponding path program 1 times [2024-11-10 04:09:23,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 04:09:23,449 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [783947221] [2024-11-10 04:09:23,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 04:09:23,449 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 04:09:23,449 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 04:09:23,452 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 04:09:23,453 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-10 04:09:24,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:09:24,332 INFO L255 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-11-10 04:09:24,356 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 04:09:56,225 WARN L286 SmtUtils]: Spent 6.93s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-10 04:10:04,392 WARN L286 SmtUtils]: Spent 8.17s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-10 04:10:12,483 WARN L286 SmtUtils]: Spent 8.09s on a formula simplification that was a NOOP. DAG size: 8 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)