./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-42.i --full-output --architecture 32bit


--------------------------------------------------------------------------------


Checking for ERROR reachability
Using default analysis
Version 3061b6dc
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_variablewrapping_wrapper-sp_file-42.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 3d976df0441559782faf2252bd19993d5a8987fee3e7cd12d006e6d9859f8f01
--- Real Ultimate output ---
This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m
[2024-11-19 01:17:31,613 INFO  L188        SettingsManager]: Resetting all preferences to default values...
[2024-11-19 01:17:31,688 INFO  L114        SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf
[2024-11-19 01:17:31,691 WARN  L101        SettingsManager]: Preference file contains the following unknown settings:
[2024-11-19 01:17:31,692 WARN  L103        SettingsManager]:   * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2024-11-19 01:17:31,729 INFO  L130        SettingsManager]: Preferences different from defaults after loading the file:
[2024-11-19 01:17:31,731 INFO  L151        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2024-11-19 01:17:31,731 INFO  L153        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2024-11-19 01:17:31,732 INFO  L151        SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults:
[2024-11-19 01:17:31,733 INFO  L153        SettingsManager]:  * Use memory slicer=true
[2024-11-19 01:17:31,733 INFO  L151        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2024-11-19 01:17:31,733 INFO  L153        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2024-11-19 01:17:31,734 INFO  L151        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2024-11-19 01:17:31,735 INFO  L153        SettingsManager]:  * Create parallel compositions if possible=false
[2024-11-19 01:17:31,735 INFO  L153        SettingsManager]:  * Use SBE=true
[2024-11-19 01:17:31,736 INFO  L151        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2024-11-19 01:17:31,736 INFO  L153        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2024-11-19 01:17:31,736 INFO  L153        SettingsManager]:  * sizeof long=4
[2024-11-19 01:17:31,736 INFO  L153        SettingsManager]:  * Overapproximate operations on floating types=true
[2024-11-19 01:17:31,737 INFO  L153        SettingsManager]:  * sizeof POINTER=4
[2024-11-19 01:17:31,737 INFO  L153        SettingsManager]:  * Check division by zero=IGNORE
[2024-11-19 01:17:31,740 INFO  L153        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2024-11-19 01:17:31,740 INFO  L153        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2024-11-19 01:17:31,740 INFO  L153        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2024-11-19 01:17:31,740 INFO  L153        SettingsManager]:  * Allow undefined functions=false
[2024-11-19 01:17:31,741 INFO  L153        SettingsManager]:  * sizeof long double=12
[2024-11-19 01:17:31,741 INFO  L153        SettingsManager]:  * Check if freed pointer was valid=false
[2024-11-19 01:17:31,741 INFO  L153        SettingsManager]:  * Use constant arrays=true
[2024-11-19 01:17:31,741 INFO  L151        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2024-11-19 01:17:31,741 INFO  L153        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2024-11-19 01:17:31,741 INFO  L153        SettingsManager]:  * Only consider context switches at boundaries of atomic blocks=true
[2024-11-19 01:17:31,742 INFO  L153        SettingsManager]:  * SMT solver=External_DefaultMode
[2024-11-19 01:17:31,742 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-11-19 01:17:31,742 INFO  L151        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2024-11-19 01:17:31,742 INFO  L153        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2024-11-19 01:17:31,742 INFO  L153        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopHeads
[2024-11-19 01:17:31,742 INFO  L153        SettingsManager]:  * Trace refinement strategy=CAMEL
[2024-11-19 01:17:31,742 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2024-11-19 01:17:31,743 INFO  L153        SettingsManager]:  * Apply one-shot large block encoding in concurrent analysis=false
[2024-11-19 01:17:31,743 INFO  L153        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2024-11-19 01:17:31,743 INFO  L153        SettingsManager]:  * Order on configurations for Petri net unfoldings=DBO
[2024-11-19 01:17:31,743 INFO  L153        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2024-11-19 01:17:31,744 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 -> 3d976df0441559782faf2252bd19993d5a8987fee3e7cd12d006e6d9859f8f01
[2024-11-19 01:17:32,046 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2024-11-19 01:17:32,088 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2024-11-19 01:17:32,094 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2024-11-19 01:17:32,095 INFO  L270        PluginConnector]: Initializing CDTParser...
[2024-11-19 01:17:32,096 INFO  L274        PluginConnector]: CDTParser initialized
[2024-11-19 01:17:32,097 INFO  L431   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-42.i
[2024-11-19 01:17:33,542 INFO  L533              CDTParser]: Created temporary CDT project at NULL
[2024-11-19 01:17:33,747 INFO  L384              CDTParser]: Found 1 translation units.
[2024-11-19 01:17:33,748 INFO  L180              CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-42.i
[2024-11-19 01:17:33,760 INFO  L427              CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3d3ac2036/8ef46f5de076492faa803506ac58d9a6/FLAGcadfbe7b3
[2024-11-19 01:17:34,120 INFO  L435              CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3d3ac2036/8ef46f5de076492faa803506ac58d9a6
[2024-11-19 01:17:34,123 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2024-11-19 01:17:34,125 INFO  L133        ToolchainWalker]: Walking toolchain with 6 elements.
[2024-11-19 01:17:34,128 INFO  L112        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2024-11-19 01:17:34,128 INFO  L270        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2024-11-19 01:17:34,134 INFO  L274        PluginConnector]: CACSL2BoogieTranslator initialized
[2024-11-19 01:17:34,135 INFO  L184        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 01:17:34" (1/1) ...
[2024-11-19 01:17:34,138 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7dd53bf7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:17:34, skipping insertion in model container
[2024-11-19 01:17:34,138 INFO  L184        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 01:17:34" (1/1) ...
[2024-11-19 01:17:34,176 INFO  L175         MainTranslator]: Built tables and reachable declarations
[2024-11-19 01:17:34,316 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_variablewrapping_wrapper-sp_file-42.i[917,930]
[2024-11-19 01:17:34,382 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2024-11-19 01:17:34,393 INFO  L200         MainTranslator]: Completed pre-run
[2024-11-19 01:17:34,404 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_variablewrapping_wrapper-sp_file-42.i[917,930]
[2024-11-19 01:17:34,424 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2024-11-19 01:17:34,443 INFO  L204         MainTranslator]: Completed translation
[2024-11-19 01:17:34,444 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:17:34 WrapperNode
[2024-11-19 01:17:34,444 INFO  L131        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2024-11-19 01:17:34,445 INFO  L112        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2024-11-19 01:17:34,445 INFO  L270        PluginConnector]: Initializing Boogie Procedure Inliner...
[2024-11-19 01:17:34,445 INFO  L274        PluginConnector]: Boogie Procedure Inliner initialized
[2024-11-19 01:17:34,451 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:17:34" (1/1) ...
[2024-11-19 01:17:34,466 INFO  L184        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:17:34" (1/1) ...
[2024-11-19 01:17:34,512 INFO  L138                Inliner]: procedures = 30, calls = 138, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 447
[2024-11-19 01:17:34,513 INFO  L131        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2024-11-19 01:17:34,513 INFO  L112        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2024-11-19 01:17:34,513 INFO  L270        PluginConnector]: Initializing Boogie Preprocessor...
[2024-11-19 01:17:34,514 INFO  L274        PluginConnector]: Boogie Preprocessor initialized
[2024-11-19 01:17:34,526 INFO  L184        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:17:34" (1/1) ...
[2024-11-19 01:17:34,526 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:17:34" (1/1) ...
[2024-11-19 01:17:34,533 INFO  L184        PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:17:34" (1/1) ...
[2024-11-19 01:17:34,549 WARN  L109           MemorySlicer]: Omit memory slicing because it failed with the following exception: Unsupported: Memory array in LHS
[2024-11-19 01:17:34,553 INFO  L184        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:17:34" (1/1) ...
[2024-11-19 01:17:34,553 INFO  L184        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:17:34" (1/1) ...
[2024-11-19 01:17:34,567 INFO  L184        PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:17:34" (1/1) ...
[2024-11-19 01:17:34,573 INFO  L184        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:17:34" (1/1) ...
[2024-11-19 01:17:34,575 INFO  L184        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:17:34" (1/1) ...
[2024-11-19 01:17:34,577 INFO  L184        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:17:34" (1/1) ...
[2024-11-19 01:17:34,581 INFO  L131        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2024-11-19 01:17:34,582 INFO  L112        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2024-11-19 01:17:34,582 INFO  L270        PluginConnector]: Initializing RCFGBuilder...
[2024-11-19 01:17:34,582 INFO  L274        PluginConnector]: RCFGBuilder initialized
[2024-11-19 01:17:34,583 INFO  L184        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:17:34" (1/1) ...
[2024-11-19 01:17:34,587 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-11-19 01:17:34,599 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2024-11-19 01:17:34,623 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-19 01:17:34,630 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-19 01:17:34,675 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2024-11-19 01:17:34,675 INFO  L130     BoogieDeclarations]: Found specification of procedure write~unchecked~real
[2024-11-19 01:17:34,675 INFO  L130     BoogieDeclarations]: Found specification of procedure write~unchecked~int
[2024-11-19 01:17:34,676 INFO  L130     BoogieDeclarations]: Found specification of procedure read~real
[2024-11-19 01:17:34,676 INFO  L130     BoogieDeclarations]: Found specification of procedure write~int
[2024-11-19 01:17:34,676 INFO  L130     BoogieDeclarations]: Found specification of procedure write~real
[2024-11-19 01:17:34,676 INFO  L130     BoogieDeclarations]: Found specification of procedure read~int
[2024-11-19 01:17:34,676 INFO  L130     BoogieDeclarations]: Found specification of procedure assume_abort_if_not
[2024-11-19 01:17:34,676 INFO  L138     BoogieDeclarations]: Found implementation of procedure assume_abort_if_not
[2024-11-19 01:17:34,676 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int
[2024-11-19 01:17:34,676 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2024-11-19 01:17:34,676 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2024-11-19 01:17:34,763 INFO  L238             CfgBuilder]: Building ICFG
[2024-11-19 01:17:34,765 INFO  L264             CfgBuilder]: Building CFG for each procedure with an implementation
[2024-11-19 01:17:35,311 INFO  L?                        ?]: Removed 122 outVars from TransFormulas that were not future-live.
[2024-11-19 01:17:35,311 INFO  L287             CfgBuilder]: Performing block encoding
[2024-11-19 01:17:35,328 INFO  L311             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2024-11-19 01:17:35,330 INFO  L316             CfgBuilder]: Removed 1 assume(true) statements.
[2024-11-19 01:17:35,331 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 01:17:35 BoogieIcfgContainer
[2024-11-19 01:17:35,331 INFO  L131        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2024-11-19 01:17:35,332 INFO  L112        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2024-11-19 01:17:35,333 INFO  L270        PluginConnector]: Initializing TraceAbstraction...
[2024-11-19 01:17:35,336 INFO  L274        PluginConnector]: TraceAbstraction initialized
[2024-11-19 01:17:35,337 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 01:17:34" (1/3) ...
[2024-11-19 01:17:35,337 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f087b46 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 01:17:35, skipping insertion in model container
[2024-11-19 01:17:35,338 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:17:34" (2/3) ...
[2024-11-19 01:17:35,339 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f087b46 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 01:17:35, skipping insertion in model container
[2024-11-19 01:17:35,339 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 01:17:35" (3/3) ...
[2024-11-19 01:17:35,342 INFO  L112   eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-sp_file-42.i
[2024-11-19 01:17:35,358 INFO  L214   ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2024-11-19 01:17:35,359 INFO  L154   ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations.
[2024-11-19 01:17:35,434 INFO  L332      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2024-11-19 01:17:35,439 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;@18c53fda, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2024-11-19 01:17:35,442 INFO  L334      AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2024-11-19 01:17:35,450 INFO  L276                IsEmpty]: Start isEmpty. Operand  has 100 states, 86 states have (on average 1.4186046511627908) internal successors, (122), 87 states have internal predecessors, (122), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11)
[2024-11-19 01:17:35,461 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 104
[2024-11-19 01:17:35,462 INFO  L207           NwaCegarLoop]: Found error trace
[2024-11-19 01:17:35,463 INFO  L215           NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 01:17:35,464 INFO  L396      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-19 01:17:35,470 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-19 01:17:35,470 INFO  L85        PathProgramCache]: Analyzing trace with hash -442351924, now seen corresponding path program 1 times
[2024-11-19 01:17:35,477 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-19 01:17:35,480 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1796293166]
[2024-11-19 01:17:35,480 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-19 01:17:35,483 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-19 01:17:35,838 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-19 01:17:36,032 INFO  L134       CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked.
[2024-11-19 01:17:36,033 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-19 01:17:36,033 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1796293166]
[2024-11-19 01:17:36,034 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1796293166] provided 0 perfect and 1 imperfect interpolant sequences
[2024-11-19 01:17:36,034 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [593553426]
[2024-11-19 01:17:36,035 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-19 01:17:36,035 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-19 01:17:36,035 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2024-11-19 01:17:36,037 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-19 01:17:36,040 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-19 01:17:36,224 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-19 01:17:36,228 INFO  L255         TraceCheckSpWp]: Trace formula consists of 452 conjuncts, 1 conjuncts are in the unsatisfiable core
[2024-11-19 01:17:36,235 INFO  L278         TraceCheckSpWp]: Computing forward predicates...
[2024-11-19 01:17:36,255 INFO  L134       CoverageAnalysis]: Checked inductivity of 220 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked.
[2024-11-19 01:17:36,256 INFO  L307         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-11-19 01:17:36,256 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [593553426] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-19 01:17:36,256 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2024-11-19 01:17:36,257 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2
[2024-11-19 01:17:36,259 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [776324577]
[2024-11-19 01:17:36,259 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-19 01:17:36,264 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 2 states
[2024-11-19 01:17:36,264 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-19 01:17:36,285 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants.
[2024-11-19 01:17:36,286 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2024-11-19 01:17:36,288 INFO  L87              Difference]: Start difference. First operand  has 100 states, 86 states have (on average 1.4186046511627908) internal successors, (122), 87 states have internal predecessors, (122), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand  has 2 states, 2 states have (on average 26.5) internal successors, (53), 2 states have internal predecessors, (53), 2 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11)
[2024-11-19 01:17:36,316 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-19 01:17:36,316 INFO  L93              Difference]: Finished difference Result 193 states and 293 transitions.
[2024-11-19 01:17:36,317 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. 
[2024-11-19 01:17:36,319 INFO  L78                 Accepts]: Start accepts. Automaton has  has 2 states, 2 states have (on average 26.5) internal successors, (53), 2 states have internal predecessors, (53), 2 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) Word has length 103
[2024-11-19 01:17:36,319 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-19 01:17:36,326 INFO  L225             Difference]: With dead ends: 193
[2024-11-19 01:17:36,326 INFO  L226             Difference]: Without dead ends: 96
[2024-11-19 01:17:36,330 INFO  L431           NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 104 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-19 01:17:36,334 INFO  L432           NwaCegarLoop]: 135 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, 135 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-19 01:17:36,336 INFO  L433           NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2024-11-19 01:17:36,351 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 96 states.
[2024-11-19 01:17:36,368 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96.
[2024-11-19 01:17:36,370 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 96 states, 83 states have (on average 1.3614457831325302) internal successors, (113), 83 states have internal predecessors, (113), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11)
[2024-11-19 01:17:36,372 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 135 transitions.
[2024-11-19 01:17:36,373 INFO  L78                 Accepts]: Start accepts. Automaton has 96 states and 135 transitions. Word has length 103
[2024-11-19 01:17:36,373 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-11-19 01:17:36,373 INFO  L471      AbstractCegarLoop]: Abstraction has 96 states and 135 transitions.
[2024-11-19 01:17:36,374 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 2 states, 2 states have (on average 26.5) internal successors, (53), 2 states have internal predecessors, (53), 2 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11)
[2024-11-19 01:17:36,377 INFO  L276                IsEmpty]: Start isEmpty. Operand 96 states and 135 transitions.
[2024-11-19 01:17:36,380 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 104
[2024-11-19 01:17:36,381 INFO  L207           NwaCegarLoop]: Found error trace
[2024-11-19 01:17:36,381 INFO  L215           NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 01:17:36,414 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-19 01:17:36,583 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0
[2024-11-19 01:17:36,584 INFO  L396      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-19 01:17:36,584 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-19 01:17:36,584 INFO  L85        PathProgramCache]: Analyzing trace with hash -1647712550, now seen corresponding path program 1 times
[2024-11-19 01:17:36,585 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-19 01:17:36,585 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [169562096]
[2024-11-19 01:17:36,585 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-19 01:17:36,585 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-19 01:17:36,810 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-19 01:17:37,079 INFO  L134       CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked.
[2024-11-19 01:17:37,080 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-19 01:17:37,080 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [169562096]
[2024-11-19 01:17:37,080 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [169562096] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-19 01:17:37,080 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-19 01:17:37,080 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-11-19 01:17:37,081 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1089415309]
[2024-11-19 01:17:37,081 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-19 01:17:37,081 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-11-19 01:17:37,082 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-19 01:17:37,082 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-11-19 01:17:37,082 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-19 01:17:37,083 INFO  L87              Difference]: Start difference. First operand 96 states and 135 transitions. Second operand  has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11)
[2024-11-19 01:17:37,101 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-19 01:17:37,102 INFO  L93              Difference]: Finished difference Result 187 states and 264 transitions.
[2024-11-19 01:17:37,102 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-11-19 01:17:37,102 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 103
[2024-11-19 01:17:37,103 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-19 01:17:37,104 INFO  L225             Difference]: With dead ends: 187
[2024-11-19 01:17:37,104 INFO  L226             Difference]: Without dead ends: 94
[2024-11-19 01:17:37,105 INFO  L431           NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-19 01:17:37,106 INFO  L432           NwaCegarLoop]: 130 mSDtfsCounter, 0 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 257 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-19 01:17:37,107 INFO  L433           NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 257 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2024-11-19 01:17:37,108 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 94 states.
[2024-11-19 01:17:37,114 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94.
[2024-11-19 01:17:37,115 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 94 states, 81 states have (on average 1.345679012345679) internal successors, (109), 81 states have internal predecessors, (109), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11)
[2024-11-19 01:17:37,116 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 131 transitions.
[2024-11-19 01:17:37,117 INFO  L78                 Accepts]: Start accepts. Automaton has 94 states and 131 transitions. Word has length 103
[2024-11-19 01:17:37,118 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-11-19 01:17:37,118 INFO  L471      AbstractCegarLoop]: Abstraction has 94 states and 131 transitions.
[2024-11-19 01:17:37,119 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11)
[2024-11-19 01:17:37,119 INFO  L276                IsEmpty]: Start isEmpty. Operand 94 states and 131 transitions.
[2024-11-19 01:17:37,120 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 104
[2024-11-19 01:17:37,121 INFO  L207           NwaCegarLoop]: Found error trace
[2024-11-19 01:17:37,121 INFO  L215           NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 01:17:37,121 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2024-11-19 01:17:37,121 INFO  L396      AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-19 01:17:37,122 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-19 01:17:37,122 INFO  L85        PathProgramCache]: Analyzing trace with hash 808357329, now seen corresponding path program 1 times
[2024-11-19 01:17:37,122 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-19 01:17:37,123 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [447687937]
[2024-11-19 01:17:37,123 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-19 01:17:37,123 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-19 01:17:37,261 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-19 01:17:37,691 INFO  L134       CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked.
[2024-11-19 01:17:37,691 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-19 01:17:37,691 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [447687937]
[2024-11-19 01:17:37,691 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [447687937] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-19 01:17:37,691 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-19 01:17:37,692 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2024-11-19 01:17:37,692 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [369702192]
[2024-11-19 01:17:37,692 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-19 01:17:37,692 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2024-11-19 01:17:37,692 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-19 01:17:37,693 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2024-11-19 01:17:37,693 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2024-11-19 01:17:37,695 INFO  L87              Difference]: Start difference. First operand 94 states and 131 transitions. Second operand  has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11)
[2024-11-19 01:17:37,810 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-19 01:17:37,810 INFO  L93              Difference]: Finished difference Result 185 states and 259 transitions.
[2024-11-19 01:17:37,812 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2024-11-19 01:17:37,812 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 103
[2024-11-19 01:17:37,813 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-19 01:17:37,813 INFO  L225             Difference]: With dead ends: 185
[2024-11-19 01:17:37,814 INFO  L226             Difference]: Without dead ends: 94
[2024-11-19 01:17:37,814 INFO  L431           NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2024-11-19 01:17:37,815 INFO  L432           NwaCegarLoop]: 128 mSDtfsCounter, 0 mSDsluCounter, 208 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 336 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2024-11-19 01:17:37,815 INFO  L433           NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 336 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2024-11-19 01:17:37,816 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 94 states.
[2024-11-19 01:17:37,822 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94.
[2024-11-19 01:17:37,824 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 94 states, 81 states have (on average 1.3333333333333333) internal successors, (108), 81 states have internal predecessors, (108), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11)
[2024-11-19 01:17:37,826 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 130 transitions.
[2024-11-19 01:17:37,826 INFO  L78                 Accepts]: Start accepts. Automaton has 94 states and 130 transitions. Word has length 103
[2024-11-19 01:17:37,827 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-11-19 01:17:37,828 INFO  L471      AbstractCegarLoop]: Abstraction has 94 states and 130 transitions.
[2024-11-19 01:17:37,828 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11)
[2024-11-19 01:17:37,828 INFO  L276                IsEmpty]: Start isEmpty. Operand 94 states and 130 transitions.
[2024-11-19 01:17:37,829 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 104
[2024-11-19 01:17:37,829 INFO  L207           NwaCegarLoop]: Found error trace
[2024-11-19 01:17:37,830 INFO  L215           NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 01:17:37,831 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2024-11-19 01:17:37,831 INFO  L396      AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-19 01:17:37,832 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-19 01:17:37,832 INFO  L85        PathProgramCache]: Analyzing trace with hash 948905939, now seen corresponding path program 1 times
[2024-11-19 01:17:37,832 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-19 01:17:37,832 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1599157901]
[2024-11-19 01:17:37,832 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-19 01:17:37,832 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-19 01:17:37,905 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-19 01:17:38,173 INFO  L134       CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked.
[2024-11-19 01:17:38,175 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-19 01:17:38,175 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1599157901]
[2024-11-19 01:17:38,175 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1599157901] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-19 01:17:38,176 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-19 01:17:38,176 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2024-11-19 01:17:38,176 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1963765805]
[2024-11-19 01:17:38,176 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-19 01:17:38,176 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2024-11-19 01:17:38,179 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-19 01:17:38,180 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2024-11-19 01:17:38,180 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2024-11-19 01:17:38,180 INFO  L87              Difference]: Start difference. First operand 94 states and 130 transitions. Second operand  has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11)
[2024-11-19 01:17:38,319 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-19 01:17:38,320 INFO  L93              Difference]: Finished difference Result 185 states and 257 transitions.
[2024-11-19 01:17:38,320 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2024-11-19 01:17:38,321 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 103
[2024-11-19 01:17:38,321 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-19 01:17:38,322 INFO  L225             Difference]: With dead ends: 185
[2024-11-19 01:17:38,324 INFO  L226             Difference]: Without dead ends: 94
[2024-11-19 01:17:38,325 INFO  L431           NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2024-11-19 01:17:38,326 INFO  L432           NwaCegarLoop]: 126 mSDtfsCounter, 0 mSDsluCounter, 204 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 330 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2024-11-19 01:17:38,326 INFO  L433           NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 330 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2024-11-19 01:17:38,327 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 94 states.
[2024-11-19 01:17:38,333 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94.
[2024-11-19 01:17:38,335 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 94 states, 81 states have (on average 1.3209876543209877) internal successors, (107), 81 states have internal predecessors, (107), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11)
[2024-11-19 01:17:38,336 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 129 transitions.
[2024-11-19 01:17:38,338 INFO  L78                 Accepts]: Start accepts. Automaton has 94 states and 129 transitions. Word has length 103
[2024-11-19 01:17:38,339 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-11-19 01:17:38,339 INFO  L471      AbstractCegarLoop]: Abstraction has 94 states and 129 transitions.
[2024-11-19 01:17:38,339 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11)
[2024-11-19 01:17:38,339 INFO  L276                IsEmpty]: Start isEmpty. Operand 94 states and 129 transitions.
[2024-11-19 01:17:38,340 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 104
[2024-11-19 01:17:38,340 INFO  L207           NwaCegarLoop]: Found error trace
[2024-11-19 01:17:38,340 INFO  L215           NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 01:17:38,340 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2024-11-19 01:17:38,340 INFO  L396      AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-19 01:17:38,340 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-19 01:17:38,341 INFO  L85        PathProgramCache]: Analyzing trace with hash -62211311, now seen corresponding path program 1 times
[2024-11-19 01:17:38,341 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-19 01:17:38,341 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [625561427]
[2024-11-19 01:17:38,341 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-19 01:17:38,341 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-19 01:17:38,499 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-19 01:17:43,299 INFO  L134       CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked.
[2024-11-19 01:17:43,299 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-19 01:17:43,299 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [625561427]
[2024-11-19 01:17:43,299 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [625561427] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-19 01:17:43,300 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-19 01:17:43,300 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14
[2024-11-19 01:17:43,300 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1800980186]
[2024-11-19 01:17:43,300 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-19 01:17:43,300 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 14 states
[2024-11-19 01:17:43,301 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-19 01:17:43,301 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants.
[2024-11-19 01:17:43,302 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=138, Unknown=0, NotChecked=0, Total=182
[2024-11-19 01:17:43,302 INFO  L87              Difference]: Start difference. First operand 94 states and 129 transitions. Second operand  has 14 states, 14 states have (on average 3.642857142857143) internal successors, (51), 14 states have internal predecessors, (51), 3 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11)
[2024-11-19 01:17:43,991 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-19 01:17:43,992 INFO  L93              Difference]: Finished difference Result 280 states and 386 transitions.
[2024-11-19 01:17:43,992 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-11-19 01:17:43,992 INFO  L78                 Accepts]: Start accepts. Automaton has  has 14 states, 14 states have (on average 3.642857142857143) internal successors, (51), 14 states have internal predecessors, (51), 3 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) Word has length 103
[2024-11-19 01:17:43,993 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-19 01:17:43,995 INFO  L225             Difference]: With dead ends: 280
[2024-11-19 01:17:43,995 INFO  L226             Difference]: Without dead ends: 189
[2024-11-19 01:17:43,996 INFO  L431           NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=81, Invalid=261, Unknown=0, NotChecked=0, Total=342
[2024-11-19 01:17:43,996 INFO  L432           NwaCegarLoop]: 78 mSDtfsCounter, 239 mSDsluCounter, 362 mSDsCounter, 0 mSdLazyCounter, 367 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 239 SdHoareTripleChecker+Valid, 440 SdHoareTripleChecker+Invalid, 393 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 367 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time
[2024-11-19 01:17:43,997 INFO  L433           NwaCegarLoop]: SdHoareTripleChecker [239 Valid, 440 Invalid, 393 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 367 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time]
[2024-11-19 01:17:44,001 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 189 states.
[2024-11-19 01:17:44,033 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 157.
[2024-11-19 01:17:44,033 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 157 states, 132 states have (on average 1.303030303030303) internal successors, (172), 132 states have internal predecessors, (172), 22 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22)
[2024-11-19 01:17:44,035 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 216 transitions.
[2024-11-19 01:17:44,035 INFO  L78                 Accepts]: Start accepts. Automaton has 157 states and 216 transitions. Word has length 103
[2024-11-19 01:17:44,035 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-11-19 01:17:44,035 INFO  L471      AbstractCegarLoop]: Abstraction has 157 states and 216 transitions.
[2024-11-19 01:17:44,036 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 14 states, 14 states have (on average 3.642857142857143) internal successors, (51), 14 states have internal predecessors, (51), 3 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11)
[2024-11-19 01:17:44,036 INFO  L276                IsEmpty]: Start isEmpty. Operand 157 states and 216 transitions.
[2024-11-19 01:17:44,037 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 104
[2024-11-19 01:17:44,037 INFO  L207           NwaCegarLoop]: Found error trace
[2024-11-19 01:17:44,037 INFO  L215           NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 01:17:44,037 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2024-11-19 01:17:44,037 INFO  L396      AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-19 01:17:44,038 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-19 01:17:44,038 INFO  L85        PathProgramCache]: Analyzing trace with hash 638853267, now seen corresponding path program 1 times
[2024-11-19 01:17:44,038 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-19 01:17:44,038 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1177138847]
[2024-11-19 01:17:44,038 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-19 01:17:44,038 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-19 01:17:44,109 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-19 01:17:47,044 INFO  L134       CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked.
[2024-11-19 01:17:47,045 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-19 01:17:47,045 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1177138847]
[2024-11-19 01:17:47,045 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1177138847] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-19 01:17:47,045 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-19 01:17:47,045 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16
[2024-11-19 01:17:47,045 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [657554915]
[2024-11-19 01:17:47,045 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-19 01:17:47,046 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 16 states
[2024-11-19 01:17:47,046 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-19 01:17:47,047 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants.
[2024-11-19 01:17:47,047 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=197, Unknown=0, NotChecked=0, Total=240
[2024-11-19 01:17:47,047 INFO  L87              Difference]: Start difference. First operand 157 states and 216 transitions. Second operand  has 16 states, 16 states have (on average 3.1875) internal successors, (51), 16 states have internal predecessors, (51), 3 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11)
[2024-11-19 01:17:47,775 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-19 01:17:47,775 INFO  L93              Difference]: Finished difference Result 302 states and 417 transitions.
[2024-11-19 01:17:47,776 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. 
[2024-11-19 01:17:47,776 INFO  L78                 Accepts]: Start accepts. Automaton has  has 16 states, 16 states have (on average 3.1875) internal successors, (51), 16 states have internal predecessors, (51), 3 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) Word has length 103
[2024-11-19 01:17:47,776 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-19 01:17:47,777 INFO  L225             Difference]: With dead ends: 302
[2024-11-19 01:17:47,777 INFO  L226             Difference]: Without dead ends: 211
[2024-11-19 01:17:47,778 INFO  L431           NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 7 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 118 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=96, Invalid=456, Unknown=0, NotChecked=0, Total=552
[2024-11-19 01:17:47,779 INFO  L432           NwaCegarLoop]: 78 mSDtfsCounter, 226 mSDsluCounter, 546 mSDsCounter, 0 mSdLazyCounter, 565 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 226 SdHoareTripleChecker+Valid, 624 SdHoareTripleChecker+Invalid, 591 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 565 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time
[2024-11-19 01:17:47,779 INFO  L433           NwaCegarLoop]: SdHoareTripleChecker [226 Valid, 624 Invalid, 591 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 565 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time]
[2024-11-19 01:17:47,780 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 211 states.
[2024-11-19 01:17:47,792 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 175.
[2024-11-19 01:17:47,792 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 175 states, 150 states have (on average 1.3066666666666666) internal successors, (196), 150 states have internal predecessors, (196), 22 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22)
[2024-11-19 01:17:47,793 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 240 transitions.
[2024-11-19 01:17:47,793 INFO  L78                 Accepts]: Start accepts. Automaton has 175 states and 240 transitions. Word has length 103
[2024-11-19 01:17:47,793 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-11-19 01:17:47,793 INFO  L471      AbstractCegarLoop]: Abstraction has 175 states and 240 transitions.
[2024-11-19 01:17:47,794 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 16 states, 16 states have (on average 3.1875) internal successors, (51), 16 states have internal predecessors, (51), 3 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11)
[2024-11-19 01:17:47,794 INFO  L276                IsEmpty]: Start isEmpty. Operand 175 states and 240 transitions.
[2024-11-19 01:17:47,794 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 104
[2024-11-19 01:17:47,794 INFO  L207           NwaCegarLoop]: Found error trace
[2024-11-19 01:17:47,795 INFO  L215           NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 01:17:47,795 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2024-11-19 01:17:47,795 INFO  L396      AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-19 01:17:47,795 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-19 01:17:47,795 INFO  L85        PathProgramCache]: Analyzing trace with hash -432373780, now seen corresponding path program 1 times
[2024-11-19 01:17:47,796 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-19 01:17:47,796 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [167652152]
[2024-11-19 01:17:47,796 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-19 01:17:47,796 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-19 01:17:47,834 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-19 01:17:47,917 INFO  L134       CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked.
[2024-11-19 01:17:47,917 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-19 01:17:47,917 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [167652152]
[2024-11-19 01:17:47,917 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [167652152] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-19 01:17:47,918 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-19 01:17:47,918 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-11-19 01:17:47,918 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1406729095]
[2024-11-19 01:17:47,918 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-19 01:17:47,918 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-11-19 01:17:47,918 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-19 01:17:47,919 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-11-19 01:17:47,919 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-19 01:17:47,919 INFO  L87              Difference]: Start difference. First operand 175 states and 240 transitions. Second operand  has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11)
[2024-11-19 01:17:47,932 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-19 01:17:47,933 INFO  L93              Difference]: Finished difference Result 266 states and 365 transitions.
[2024-11-19 01:17:47,933 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-11-19 01:17:47,933 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 103
[2024-11-19 01:17:47,934 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-19 01:17:47,934 INFO  L225             Difference]: With dead ends: 266
[2024-11-19 01:17:47,935 INFO  L226             Difference]: Without dead ends: 169
[2024-11-19 01:17:47,935 INFO  L431           NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-19 01:17:47,936 INFO  L432           NwaCegarLoop]: 124 mSDtfsCounter, 0 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 245 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-19 01:17:47,936 INFO  L433           NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 245 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2024-11-19 01:17:47,936 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 169 states.
[2024-11-19 01:17:47,947 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 169.
[2024-11-19 01:17:47,947 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 169 states, 144 states have (on average 1.2777777777777777) internal successors, (184), 144 states have internal predecessors, (184), 22 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22)
[2024-11-19 01:17:47,948 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 228 transitions.
[2024-11-19 01:17:47,948 INFO  L78                 Accepts]: Start accepts. Automaton has 169 states and 228 transitions. Word has length 103
[2024-11-19 01:17:47,948 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-11-19 01:17:47,948 INFO  L471      AbstractCegarLoop]: Abstraction has 169 states and 228 transitions.
[2024-11-19 01:17:47,949 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11)
[2024-11-19 01:17:47,949 INFO  L276                IsEmpty]: Start isEmpty. Operand 169 states and 228 transitions.
[2024-11-19 01:17:47,949 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 104
[2024-11-19 01:17:47,949 INFO  L207           NwaCegarLoop]: Found error trace
[2024-11-19 01:17:47,950 INFO  L215           NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 01:17:47,950 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2024-11-19 01:17:47,950 INFO  L396      AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-19 01:17:47,950 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-19 01:17:47,950 INFO  L85        PathProgramCache]: Analyzing trace with hash 1666529809, now seen corresponding path program 1 times
[2024-11-19 01:17:47,950 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-19 01:17:47,950 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1517307008]
[2024-11-19 01:17:47,951 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-19 01:17:47,951 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-19 01:17:47,998 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-19 01:17:50,490 INFO  L134       CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked.
[2024-11-19 01:17:50,491 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-19 01:17:50,491 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1517307008]
[2024-11-19 01:17:50,491 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1517307008] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-19 01:17:50,491 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-19 01:17:50,491 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15
[2024-11-19 01:17:50,491 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [23048292]
[2024-11-19 01:17:50,492 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-19 01:17:50,492 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 15 states
[2024-11-19 01:17:50,492 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-19 01:17:50,492 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants.
[2024-11-19 01:17:50,493 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210
[2024-11-19 01:17:50,493 INFO  L87              Difference]: Start difference. First operand 169 states and 228 transitions. Second operand  has 15 states, 14 states have (on average 3.642857142857143) internal successors, (51), 15 states have internal predecessors, (51), 3 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11)
[2024-11-19 01:17:51,397 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-19 01:17:51,397 INFO  L93              Difference]: Finished difference Result 260 states and 353 transitions.
[2024-11-19 01:17:51,397 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-11-19 01:17:51,397 INFO  L78                 Accepts]: Start accepts. Automaton has  has 15 states, 14 states have (on average 3.642857142857143) internal successors, (51), 15 states have internal predecessors, (51), 3 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) Word has length 103
[2024-11-19 01:17:51,398 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-19 01:17:51,399 INFO  L225             Difference]: With dead ends: 260
[2024-11-19 01:17:51,399 INFO  L226             Difference]: Without dead ends: 171
[2024-11-19 01:17:51,399 INFO  L431           NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=113, Invalid=307, Unknown=0, NotChecked=0, Total=420
[2024-11-19 01:17:51,400 INFO  L432           NwaCegarLoop]: 73 mSDtfsCounter, 239 mSDsluCounter, 327 mSDsCounter, 0 mSdLazyCounter, 433 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 240 SdHoareTripleChecker+Valid, 400 SdHoareTripleChecker+Invalid, 444 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 433 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time
[2024-11-19 01:17:51,400 INFO  L433           NwaCegarLoop]: SdHoareTripleChecker [240 Valid, 400 Invalid, 444 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 433 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time]
[2024-11-19 01:17:51,400 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 171 states.
[2024-11-19 01:17:51,413 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 153.
[2024-11-19 01:17:51,413 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 153 states, 128 states have (on average 1.2734375) internal successors, (163), 128 states have internal predecessors, (163), 22 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22)
[2024-11-19 01:17:51,414 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 207 transitions.
[2024-11-19 01:17:51,414 INFO  L78                 Accepts]: Start accepts. Automaton has 153 states and 207 transitions. Word has length 103
[2024-11-19 01:17:51,414 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-11-19 01:17:51,414 INFO  L471      AbstractCegarLoop]: Abstraction has 153 states and 207 transitions.
[2024-11-19 01:17:51,415 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 15 states, 14 states have (on average 3.642857142857143) internal successors, (51), 15 states have internal predecessors, (51), 3 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11)
[2024-11-19 01:17:51,415 INFO  L276                IsEmpty]: Start isEmpty. Operand 153 states and 207 transitions.
[2024-11-19 01:17:51,415 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 106
[2024-11-19 01:17:51,415 INFO  L207           NwaCegarLoop]: Found error trace
[2024-11-19 01:17:51,415 INFO  L215           NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 01:17:51,416 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2024-11-19 01:17:51,416 INFO  L396      AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-19 01:17:51,416 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-19 01:17:51,416 INFO  L85        PathProgramCache]: Analyzing trace with hash -1629481078, now seen corresponding path program 1 times
[2024-11-19 01:17:51,417 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-19 01:17:51,417 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1066555006]
[2024-11-19 01:17:51,417 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-19 01:17:51,417 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-19 01:17:51,489 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-19 01:17:51,489 INFO  L356             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-11-19 01:17:51,562 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-19 01:17:51,603 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2024-11-19 01:17:51,603 INFO  L325         BasicCegarLoop]: Counterexample is feasible
[2024-11-19 01:17:51,604 INFO  L782   garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining)
[2024-11-19 01:17:51,606 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8
[2024-11-19 01:17:51,608 INFO  L407         BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-19 01:17:51,708 INFO  L170   ceAbstractionStarter]: Computing trace abstraction results
[2024-11-19 01:17:51,712 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 01:17:51 BoogieIcfgContainer
[2024-11-19 01:17:51,713 INFO  L131        PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2024-11-19 01:17:51,714 INFO  L112        PluginConnector]: ------------------------Witness Printer----------------------------
[2024-11-19 01:17:51,714 INFO  L270        PluginConnector]: Initializing Witness Printer...
[2024-11-19 01:17:51,714 INFO  L274        PluginConnector]: Witness Printer initialized
[2024-11-19 01:17:51,714 INFO  L184        PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 01:17:35" (3/4) ...
[2024-11-19 01:17:51,716 INFO  L145         WitnessPrinter]: No result that supports witness generation found
[2024-11-19 01:17:51,717 INFO  L131        PluginConnector]: ------------------------ END Witness Printer----------------------------
[2024-11-19 01:17:51,717 INFO  L158              Benchmark]: Toolchain (without parser) took 17592.72ms. Allocated memory was 138.4MB in the beginning and 761.3MB in the end (delta: 622.9MB). Free memory was 70.2MB in the beginning and 484.9MB in the end (delta: -414.7MB). Peak memory consumption was 209.1MB. Max. memory is 16.1GB.
[2024-11-19 01:17:51,717 INFO  L158              Benchmark]: CDTParser took 3.41ms. Allocated memory is still 138.4MB. Free memory was 101.6MB in the beginning and 101.6MB in the end (delta: 8.4kB). There was no memory consumed. Max. memory is 16.1GB.
[2024-11-19 01:17:51,718 INFO  L158              Benchmark]: CACSL2BoogieTranslator took 316.32ms. Allocated memory was 138.4MB in the beginning and 190.8MB in the end (delta: 52.4MB). Free memory was 70.0MB in the beginning and 150.6MB in the end (delta: -80.6MB). Peak memory consumption was 9.0MB. Max. memory is 16.1GB.
[2024-11-19 01:17:51,718 INFO  L158              Benchmark]: Boogie Procedure Inliner took 67.74ms. Allocated memory is still 190.8MB. Free memory was 150.6MB in the beginning and 147.3MB in the end (delta: 3.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB.
[2024-11-19 01:17:51,718 INFO  L158              Benchmark]: Boogie Preprocessor took 67.92ms. Allocated memory is still 190.8MB. Free memory was 147.3MB in the beginning and 143.9MB in the end (delta: 3.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB.
[2024-11-19 01:17:51,719 INFO  L158              Benchmark]: RCFGBuilder took 749.05ms. Allocated memory is still 190.8MB. Free memory was 143.9MB in the beginning and 109.5MB in the end (delta: 34.4MB). Peak memory consumption was 35.7MB. Max. memory is 16.1GB.
[2024-11-19 01:17:51,719 INFO  L158              Benchmark]: TraceAbstraction took 16380.64ms. Allocated memory was 190.8MB in the beginning and 761.3MB in the end (delta: 570.4MB). Free memory was 108.7MB in the beginning and 484.9MB in the end (delta: -376.2MB). Peak memory consumption was 193.8MB. Max. memory is 16.1GB.
[2024-11-19 01:17:51,719 INFO  L158              Benchmark]: Witness Printer took 3.35ms. Allocated memory is still 761.3MB. Free memory is still 484.9MB. There was no memory consumed. Max. memory is 16.1GB.
[2024-11-19 01:17:51,720 INFO  L338   ainManager$Toolchain]: #######################  End [Toolchain 1] #######################
 --- Results ---
 * Results from de.uni_freiburg.informatik.ultimate.core:
  - StatisticsResult: Toolchain Benchmarks
    Benchmark results are:
 * CDTParser took 3.41ms. Allocated memory is still 138.4MB. Free memory was 101.6MB in the beginning and 101.6MB in the end (delta: 8.4kB). There was no memory consumed. Max. memory is 16.1GB.
 * CACSL2BoogieTranslator took 316.32ms. Allocated memory was 138.4MB in the beginning and 190.8MB in the end (delta: 52.4MB). Free memory was 70.0MB in the beginning and 150.6MB in the end (delta: -80.6MB). Peak memory consumption was 9.0MB. Max. memory is 16.1GB.
 * Boogie Procedure Inliner took 67.74ms. Allocated memory is still 190.8MB. Free memory was 150.6MB in the beginning and 147.3MB in the end (delta: 3.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB.
 * Boogie Preprocessor took 67.92ms. Allocated memory is still 190.8MB. Free memory was 147.3MB in the beginning and 143.9MB in the end (delta: 3.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB.
 * RCFGBuilder took 749.05ms. Allocated memory is still 190.8MB. Free memory was 143.9MB in the beginning and 109.5MB in the end (delta: 34.4MB). Peak memory consumption was 35.7MB. Max. memory is 16.1GB.
 * TraceAbstraction took 16380.64ms. Allocated memory was 190.8MB in the beginning and 761.3MB in the end (delta: 570.4MB). Free memory was 108.7MB in the beginning and 484.9MB in the end (delta: -376.2MB). Peak memory consumption was 193.8MB. Max. memory is 16.1GB.
 * Witness Printer took 3.35ms. Allocated memory is still 761.3MB. Free memory is still 484.9MB. 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 109. 
Possible FailurePath: 
[L35]                    unsigned char isInitial = 0;
[L36-L48]                struct WrapperStruct00 WrapperStruct00 = {
 -1,
 5,
 4,
 16.5,
 127.25,
 1,
 0,
 0,
 0,
 0,
 0
};
[L49]                    signed long int* WrapperStruct00_var_1_1_Pointer = &(WrapperStruct00.var_1_1);
[L50]                    unsigned char* WrapperStruct00_var_1_8_Pointer = &(WrapperStruct00.var_1_8);
[L51]                    unsigned char* WrapperStruct00_var_1_9_Pointer = &(WrapperStruct00.var_1_9);
[L52]                    float* WrapperStruct00_var_1_10_Pointer = &(WrapperStruct00.var_1_10);
[L53]                    float* WrapperStruct00_var_1_11_Pointer = &(WrapperStruct00.var_1_11);
[L54]                    unsigned char* WrapperStruct00_var_1_12_Pointer = &(WrapperStruct00.var_1_12);
[L55]                    unsigned char* WrapperStruct00_var_1_13_Pointer = &(WrapperStruct00.var_1_13);
[L56]                    unsigned char* WrapperStruct00_var_1_15_Pointer = &(WrapperStruct00.var_1_15);
[L57]                    unsigned char* WrapperStruct00_var_1_16_Pointer = &(WrapperStruct00.var_1_16);
[L58]                    unsigned char* WrapperStruct00_var_1_17_Pointer = &(WrapperStruct00.var_1_17);
[L59]                    unsigned char* WrapperStruct00_var_1_18_Pointer = &(WrapperStruct00.var_1_18);
             VAL         [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_15_Pointer={4:16}, WrapperStruct00_var_1_16_Pointer={4:17}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_18_Pointer={4:19}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:5}, isInitial=0]
[L113]                   isInitial = 1
[L114]       FCALL       initially()
[L115]       COND TRUE   1
[L116]       FCALL       updateLastVariables()
[L117]       CALL        updateVariables()
[L88]                    WrapperStruct00.var_1_9 = __VERIFIER_nondet_uchar()
[L89]        EXPR        WrapperStruct00.var_1_9
             VAL         [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_15_Pointer={4:16}, WrapperStruct00_var_1_16_Pointer={4:17}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_18_Pointer={4:19}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:5}, isInitial=1]
[L89]        CALL        assume_abort_if_not(WrapperStruct00.var_1_9 >= 0)
             VAL         [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_15_Pointer={4:16}, WrapperStruct00_var_1_16_Pointer={4:17}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_18_Pointer={4:19}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:5}, \old(cond)=1, isInitial=1]
[L20]        COND FALSE  !(!cond)
             VAL         [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_15_Pointer={4:16}, WrapperStruct00_var_1_16_Pointer={4:17}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_18_Pointer={4:19}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:5}, \old(cond)=1, isInitial=1]
[L89]        RET         assume_abort_if_not(WrapperStruct00.var_1_9 >= 0)
             VAL         [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_15_Pointer={4:16}, WrapperStruct00_var_1_16_Pointer={4:17}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_18_Pointer={4:19}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:5}, isInitial=1]
[L90]        EXPR        WrapperStruct00.var_1_9
             VAL         [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_15_Pointer={4:16}, WrapperStruct00_var_1_16_Pointer={4:17}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_18_Pointer={4:19}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:5}, isInitial=1]
[L90]        CALL        assume_abort_if_not(WrapperStruct00.var_1_9 <= 127)
             VAL         [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_15_Pointer={4:16}, WrapperStruct00_var_1_16_Pointer={4:17}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_18_Pointer={4:19}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:5}, \old(cond)=1, isInitial=1]
[L20]        COND FALSE  !(!cond)
             VAL         [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_15_Pointer={4:16}, WrapperStruct00_var_1_16_Pointer={4:17}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_18_Pointer={4:19}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:5}, \old(cond)=1, isInitial=1]
[L90]        RET         assume_abort_if_not(WrapperStruct00.var_1_9 <= 127)
             VAL         [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_15_Pointer={4:16}, WrapperStruct00_var_1_16_Pointer={4:17}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_18_Pointer={4:19}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:5}, isInitial=1]
[L91]                    WrapperStruct00.var_1_11 = __VERIFIER_nondet_float()
[L92]        EXPR        WrapperStruct00.var_1_11
[L92]        EXPR        WrapperStruct00.var_1_11 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_11 <= -1.0e-20F
[L92]        EXPR        WrapperStruct00.var_1_11
[L92]        EXPR        WrapperStruct00.var_1_11 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_11 <= -1.0e-20F
             VAL         [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_15_Pointer={4:16}, WrapperStruct00_var_1_16_Pointer={4:17}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_18_Pointer={4:19}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:5}, isInitial=1]
[L92]        EXPR        (WrapperStruct00.var_1_11 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_11 <= -1.0e-20F) || (WrapperStruct00.var_1_11 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_11 >= 1.0e-20F )
             VAL         [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_15_Pointer={4:16}, WrapperStruct00_var_1_16_Pointer={4:17}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_18_Pointer={4:19}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:5}, isInitial=1]
[L92]        CALL        assume_abort_if_not((WrapperStruct00.var_1_11 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_11 <= -1.0e-20F) || (WrapperStruct00.var_1_11 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_11 >= 1.0e-20F ))
             VAL         [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_15_Pointer={4:16}, WrapperStruct00_var_1_16_Pointer={4:17}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_18_Pointer={4:19}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:5}, \old(cond)=1, isInitial=1]
[L20]        COND FALSE  !(!cond)
             VAL         [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_15_Pointer={4:16}, WrapperStruct00_var_1_16_Pointer={4:17}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_18_Pointer={4:19}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:5}, \old(cond)=1, isInitial=1]
[L92]        RET         assume_abort_if_not((WrapperStruct00.var_1_11 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_11 <= -1.0e-20F) || (WrapperStruct00.var_1_11 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_11 >= 1.0e-20F ))
             VAL         [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_15_Pointer={4:16}, WrapperStruct00_var_1_16_Pointer={4:17}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_18_Pointer={4:19}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:5}, isInitial=1]
[L93]                    WrapperStruct00.var_1_13 = __VERIFIER_nondet_uchar()
[L94]        EXPR        WrapperStruct00.var_1_13
             VAL         [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_15_Pointer={4:16}, WrapperStruct00_var_1_16_Pointer={4:17}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_18_Pointer={4:19}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:5}, isInitial=1]
[L94]        CALL        assume_abort_if_not(WrapperStruct00.var_1_13 >= 0)
             VAL         [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_15_Pointer={4:16}, WrapperStruct00_var_1_16_Pointer={4:17}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_18_Pointer={4:19}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:5}, \old(cond)=1, isInitial=1]
[L20]        COND FALSE  !(!cond)
             VAL         [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_15_Pointer={4:16}, WrapperStruct00_var_1_16_Pointer={4:17}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_18_Pointer={4:19}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:5}, \old(cond)=1, isInitial=1]
[L94]        RET         assume_abort_if_not(WrapperStruct00.var_1_13 >= 0)
             VAL         [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_15_Pointer={4:16}, WrapperStruct00_var_1_16_Pointer={4:17}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_18_Pointer={4:19}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:5}, isInitial=1]
[L95]        EXPR        WrapperStruct00.var_1_13
             VAL         [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_15_Pointer={4:16}, WrapperStruct00_var_1_16_Pointer={4:17}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_18_Pointer={4:19}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:5}, isInitial=1]
[L95]        CALL        assume_abort_if_not(WrapperStruct00.var_1_13 <= 0)
             VAL         [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_15_Pointer={4:16}, WrapperStruct00_var_1_16_Pointer={4:17}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_18_Pointer={4:19}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:5}, \old(cond)=1, isInitial=1]
[L20]        COND FALSE  !(!cond)
             VAL         [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_15_Pointer={4:16}, WrapperStruct00_var_1_16_Pointer={4:17}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_18_Pointer={4:19}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:5}, \old(cond)=1, isInitial=1]
[L95]        RET         assume_abort_if_not(WrapperStruct00.var_1_13 <= 0)
             VAL         [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_15_Pointer={4:16}, WrapperStruct00_var_1_16_Pointer={4:17}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_18_Pointer={4:19}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:5}, isInitial=1]
[L96]                    WrapperStruct00.var_1_15 = __VERIFIER_nondet_uchar()
[L97]        EXPR        WrapperStruct00.var_1_15
             VAL         [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_15_Pointer={4:16}, WrapperStruct00_var_1_16_Pointer={4:17}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_18_Pointer={4:19}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:5}, isInitial=1]
[L97]        CALL        assume_abort_if_not(WrapperStruct00.var_1_15 >= 0)
             VAL         [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_15_Pointer={4:16}, WrapperStruct00_var_1_16_Pointer={4:17}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_18_Pointer={4:19}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:5}, \old(cond)=1, isInitial=1]
[L20]        COND FALSE  !(!cond)
             VAL         [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_15_Pointer={4:16}, WrapperStruct00_var_1_16_Pointer={4:17}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_18_Pointer={4:19}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:5}, \old(cond)=1, isInitial=1]
[L97]        RET         assume_abort_if_not(WrapperStruct00.var_1_15 >= 0)
             VAL         [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_15_Pointer={4:16}, WrapperStruct00_var_1_16_Pointer={4:17}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_18_Pointer={4:19}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:5}, isInitial=1]
[L98]        EXPR        WrapperStruct00.var_1_15
             VAL         [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_15_Pointer={4:16}, WrapperStruct00_var_1_16_Pointer={4:17}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_18_Pointer={4:19}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:5}, isInitial=1]
[L98]        CALL        assume_abort_if_not(WrapperStruct00.var_1_15 <= 0)
             VAL         [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_15_Pointer={4:16}, WrapperStruct00_var_1_16_Pointer={4:17}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_18_Pointer={4:19}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:5}, \old(cond)=1, isInitial=1]
[L20]        COND FALSE  !(!cond)
             VAL         [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_15_Pointer={4:16}, WrapperStruct00_var_1_16_Pointer={4:17}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_18_Pointer={4:19}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:5}, \old(cond)=1, isInitial=1]
[L98]        RET         assume_abort_if_not(WrapperStruct00.var_1_15 <= 0)
             VAL         [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_15_Pointer={4:16}, WrapperStruct00_var_1_16_Pointer={4:17}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_18_Pointer={4:19}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:5}, isInitial=1]
[L99]                    WrapperStruct00.var_1_16 = __VERIFIER_nondet_uchar()
[L100]       EXPR        WrapperStruct00.var_1_16
             VAL         [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_15_Pointer={4:16}, WrapperStruct00_var_1_16_Pointer={4:17}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_18_Pointer={4:19}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:5}, isInitial=1]
[L100]       CALL        assume_abort_if_not(WrapperStruct00.var_1_16 >= 0)
             VAL         [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_15_Pointer={4:16}, WrapperStruct00_var_1_16_Pointer={4:17}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_18_Pointer={4:19}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:5}, \old(cond)=1, isInitial=1]
[L20]        COND FALSE  !(!cond)
             VAL         [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_15_Pointer={4:16}, WrapperStruct00_var_1_16_Pointer={4:17}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_18_Pointer={4:19}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:5}, \old(cond)=1, isInitial=1]
[L100]       RET         assume_abort_if_not(WrapperStruct00.var_1_16 >= 0)
             VAL         [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_15_Pointer={4:16}, WrapperStruct00_var_1_16_Pointer={4:17}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_18_Pointer={4:19}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:5}, isInitial=1]
[L101]       EXPR        WrapperStruct00.var_1_16
             VAL         [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_15_Pointer={4:16}, WrapperStruct00_var_1_16_Pointer={4:17}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_18_Pointer={4:19}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:5}, isInitial=1]
[L101]       CALL        assume_abort_if_not(WrapperStruct00.var_1_16 <= 0)
             VAL         [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_15_Pointer={4:16}, WrapperStruct00_var_1_16_Pointer={4:17}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_18_Pointer={4:19}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:5}, \old(cond)=1, isInitial=1]
[L20]        COND FALSE  !(!cond)
             VAL         [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_15_Pointer={4:16}, WrapperStruct00_var_1_16_Pointer={4:17}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_18_Pointer={4:19}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:5}, \old(cond)=1, isInitial=1]
[L101]       RET         assume_abort_if_not(WrapperStruct00.var_1_16 <= 0)
             VAL         [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_15_Pointer={4:16}, WrapperStruct00_var_1_16_Pointer={4:17}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_18_Pointer={4:19}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:5}, isInitial=1]
[L102]                   WrapperStruct00.var_1_18 = __VERIFIER_nondet_uchar()
[L103]       EXPR        WrapperStruct00.var_1_18
             VAL         [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_15_Pointer={4:16}, WrapperStruct00_var_1_16_Pointer={4:17}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_18_Pointer={4:19}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:5}, isInitial=1]
[L103]       CALL        assume_abort_if_not(WrapperStruct00.var_1_18 >= 0)
             VAL         [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_15_Pointer={4:16}, WrapperStruct00_var_1_16_Pointer={4:17}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_18_Pointer={4:19}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:5}, \old(cond)=1, isInitial=1]
[L20]        COND FALSE  !(!cond)
             VAL         [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_15_Pointer={4:16}, WrapperStruct00_var_1_16_Pointer={4:17}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_18_Pointer={4:19}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:5}, \old(cond)=1, isInitial=1]
[L103]       RET         assume_abort_if_not(WrapperStruct00.var_1_18 >= 0)
             VAL         [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_15_Pointer={4:16}, WrapperStruct00_var_1_16_Pointer={4:17}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_18_Pointer={4:19}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:5}, isInitial=1]
[L104]       EXPR        WrapperStruct00.var_1_18
             VAL         [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_15_Pointer={4:16}, WrapperStruct00_var_1_16_Pointer={4:17}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_18_Pointer={4:19}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:5}, isInitial=1]
[L104]       CALL        assume_abort_if_not(WrapperStruct00.var_1_18 <= 0)
             VAL         [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_15_Pointer={4:16}, WrapperStruct00_var_1_16_Pointer={4:17}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_18_Pointer={4:19}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:5}, \old(cond)=1, isInitial=1]
[L20]        COND FALSE  !(!cond)
             VAL         [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_15_Pointer={4:16}, WrapperStruct00_var_1_16_Pointer={4:17}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_18_Pointer={4:19}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:5}, \old(cond)=1, isInitial=1]
[L104]       RET         assume_abort_if_not(WrapperStruct00.var_1_18 <= 0)
             VAL         [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_15_Pointer={4:16}, WrapperStruct00_var_1_16_Pointer={4:17}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_18_Pointer={4:19}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:5}, isInitial=1]
[L117]       RET         updateVariables()
[L118]       CALL        step()
[L63]        EXPR        \read(*WrapperStruct00_var_1_9_Pointer)
[L63]                    (*(WrapperStruct00_var_1_8_Pointer)) = ((*(WrapperStruct00_var_1_9_Pointer)) + 100)
[L64]        EXPR        \read(*WrapperStruct00_var_1_11_Pointer)
             VAL         [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_15_Pointer={4:16}, WrapperStruct00_var_1_16_Pointer={4:17}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_18_Pointer={4:19}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:5}, isInitial=1]
[L64]        EXPR        (((*(WrapperStruct00_var_1_11_Pointer))) < (64.15f)) ? ((*(WrapperStruct00_var_1_11_Pointer))) : (64.15f)
             VAL         [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_15_Pointer={4:16}, WrapperStruct00_var_1_16_Pointer={4:17}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_18_Pointer={4:19}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:5}, isInitial=1]
[L64]                    (*(WrapperStruct00_var_1_10_Pointer)) = (((((*(WrapperStruct00_var_1_11_Pointer))) < (64.15f)) ? ((*(WrapperStruct00_var_1_11_Pointer))) : (64.15f)))
[L65]        EXPR        \read(*WrapperStruct00_var_1_8_Pointer)
[L65]        EXPR        \read(*WrapperStruct00_var_1_8_Pointer)
             VAL         [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_15_Pointer={4:16}, WrapperStruct00_var_1_16_Pointer={4:17}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_18_Pointer={4:19}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:5}, isInitial=1]
[L65]        COND FALSE  !((*(WrapperStruct00_var_1_8_Pointer)) > (*(WrapperStruct00_var_1_8_Pointer)))
[L68]        EXPR        \read(*WrapperStruct00_var_1_8_Pointer)
[L68]        EXPR        \read(*WrapperStruct00_var_1_8_Pointer)
[L68]        EXPR        \read(*WrapperStruct00_var_1_8_Pointer)
[L68]        EXPR        \read(*WrapperStruct00_var_1_8_Pointer)
             VAL         [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_15_Pointer={4:16}, WrapperStruct00_var_1_16_Pointer={4:17}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_18_Pointer={4:19}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:5}, isInitial=1]
[L68]        EXPR        ((((*(WrapperStruct00_var_1_8_Pointer)) - (*(WrapperStruct00_var_1_8_Pointer)))) > (((*(WrapperStruct00_var_1_8_Pointer)) - (*(WrapperStruct00_var_1_8_Pointer))))) ? (((*(WrapperStruct00_var_1_8_Pointer)) - (*(WrapperStruct00_var_1_8_Pointer)))) : (((*(WrapperStruct00_var_1_8_Pointer)) - (*(WrapperStruct00_var_1_8_Pointer))))
[L68]        EXPR        \read(*WrapperStruct00_var_1_8_Pointer)
[L68]        EXPR        \read(*WrapperStruct00_var_1_8_Pointer)
[L68]        EXPR        ((((*(WrapperStruct00_var_1_8_Pointer)) - (*(WrapperStruct00_var_1_8_Pointer)))) > (((*(WrapperStruct00_var_1_8_Pointer)) - (*(WrapperStruct00_var_1_8_Pointer))))) ? (((*(WrapperStruct00_var_1_8_Pointer)) - (*(WrapperStruct00_var_1_8_Pointer)))) : (((*(WrapperStruct00_var_1_8_Pointer)) - (*(WrapperStruct00_var_1_8_Pointer))))
             VAL         [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_15_Pointer={4:16}, WrapperStruct00_var_1_16_Pointer={4:17}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_18_Pointer={4:19}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:5}, isInitial=1]
[L68]                    (*(WrapperStruct00_var_1_1_Pointer)) = ((((((*(WrapperStruct00_var_1_8_Pointer)) - (*(WrapperStruct00_var_1_8_Pointer)))) > (((*(WrapperStruct00_var_1_8_Pointer)) - (*(WrapperStruct00_var_1_8_Pointer))))) ? (((*(WrapperStruct00_var_1_8_Pointer)) - (*(WrapperStruct00_var_1_8_Pointer)))) : (((*(WrapperStruct00_var_1_8_Pointer)) - (*(WrapperStruct00_var_1_8_Pointer))))))
[L70]        EXPR        \read(*WrapperStruct00_var_1_11_Pointer)
[L70]        EXPR        \read(*WrapperStruct00_var_1_10_Pointer)
             VAL         [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_15_Pointer={4:16}, WrapperStruct00_var_1_16_Pointer={4:17}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_18_Pointer={4:19}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:5}, isInitial=1]
[L70]        COND FALSE  !((*(WrapperStruct00_var_1_11_Pointer)) <= (*(WrapperStruct00_var_1_10_Pointer)))
[L75]        EXPR        \read(*WrapperStruct00_var_1_8_Pointer)
             VAL         [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_15_Pointer={4:16}, WrapperStruct00_var_1_16_Pointer={4:17}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_18_Pointer={4:19}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:5}, isInitial=1]
[L75]        COND TRUE   (*(WrapperStruct00_var_1_8_Pointer)) <= 1000000
[L76]                    (*(WrapperStruct00_var_1_17_Pointer)) = 0
             VAL         [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_15_Pointer={4:16}, WrapperStruct00_var_1_16_Pointer={4:17}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_18_Pointer={4:19}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:5}, isInitial=1]
[L81]        EXPR        \read(*WrapperStruct00_var_1_10_Pointer)
[L81]        EXPR        \read(*WrapperStruct00_var_1_11_Pointer)
             VAL         [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_15_Pointer={4:16}, WrapperStruct00_var_1_16_Pointer={4:17}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_18_Pointer={4:19}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:5}, isInitial=1]
[L81]        COND FALSE  !((- (*(WrapperStruct00_var_1_10_Pointer))) > (*(WrapperStruct00_var_1_11_Pointer)))
[L84]        EXPR        \read(*WrapperStruct00_var_1_1_Pointer)
[L84]        EXPR        \read(*WrapperStruct00_var_1_9_Pointer)
[L84]        EXPR        ((*(WrapperStruct00_var_1_1_Pointer)) <= (*(WrapperStruct00_var_1_9_Pointer))) && (*(WrapperStruct00_var_1_16_Pointer))
[L84]        EXPR        \read(*WrapperStruct00_var_1_16_Pointer)
[L84]        EXPR        ((*(WrapperStruct00_var_1_1_Pointer)) <= (*(WrapperStruct00_var_1_9_Pointer))) && (*(WrapperStruct00_var_1_16_Pointer))
             VAL         [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_15_Pointer={4:16}, WrapperStruct00_var_1_16_Pointer={4:17}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_18_Pointer={4:19}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:5}, isInitial=1]
[L84]                    (*(WrapperStruct00_var_1_12_Pointer)) = (((*(WrapperStruct00_var_1_1_Pointer)) <= (*(WrapperStruct00_var_1_9_Pointer))) && (*(WrapperStruct00_var_1_16_Pointer)))
[L118]       RET         step()
[L119]       CALL, EXPR  property()
[L109]       EXPR        \read(*WrapperStruct00_var_1_8_Pointer)
[L109]       EXPR        \read(*WrapperStruct00_var_1_8_Pointer)
             VAL         [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_15_Pointer={4:16}, WrapperStruct00_var_1_16_Pointer={4:17}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_18_Pointer={4:19}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:5}, isInitial=1]
[L109]       EXPR        ((*(WrapperStruct00_var_1_8_Pointer)) > (*(WrapperStruct00_var_1_8_Pointer))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed long int) ((((((*(WrapperStruct00_var_1_8_Pointer))) < ((*(WrapperStruct00_var_1_8_Pointer)))) ? ((*(WrapperStruct00_var_1_8_Pointer))) : ((*(WrapperStruct00_var_1_8_Pointer))))) - 10))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed long int) ((((((*(WrapperStruct00_var_1_8_Pointer)) - (*(WrapperStruct00_var_1_8_Pointer)))) > (((*(WrapperStruct00_var_1_8_Pointer)) - (*(WrapperStruct00_var_1_8_Pointer))))) ? (((*(WrapperStruct00_var_1_8_Pointer)) - (*(WrapperStruct00_var_1_8_Pointer)))) : (((*(WrapperStruct00_var_1_8_Pointer)) - (*(WrapperStruct00_var_1_8_Pointer))))))))
[L109]       EXPR        \read(*WrapperStruct00_var_1_1_Pointer)
[L109]       EXPR        \read(*WrapperStruct00_var_1_8_Pointer)
[L109]       EXPR        \read(*WrapperStruct00_var_1_8_Pointer)
[L109]       EXPR        \read(*WrapperStruct00_var_1_8_Pointer)
[L109]       EXPR        \read(*WrapperStruct00_var_1_8_Pointer)
             VAL         [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_15_Pointer={4:16}, WrapperStruct00_var_1_16_Pointer={4:17}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_18_Pointer={4:19}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:5}, isInitial=1]
[L109]       EXPR        ((((*(WrapperStruct00_var_1_8_Pointer)) - (*(WrapperStruct00_var_1_8_Pointer)))) > (((*(WrapperStruct00_var_1_8_Pointer)) - (*(WrapperStruct00_var_1_8_Pointer))))) ? (((*(WrapperStruct00_var_1_8_Pointer)) - (*(WrapperStruct00_var_1_8_Pointer)))) : (((*(WrapperStruct00_var_1_8_Pointer)) - (*(WrapperStruct00_var_1_8_Pointer))))
[L109]       EXPR        \read(*WrapperStruct00_var_1_8_Pointer)
[L109]       EXPR        \read(*WrapperStruct00_var_1_8_Pointer)
[L109]       EXPR        ((((*(WrapperStruct00_var_1_8_Pointer)) - (*(WrapperStruct00_var_1_8_Pointer)))) > (((*(WrapperStruct00_var_1_8_Pointer)) - (*(WrapperStruct00_var_1_8_Pointer))))) ? (((*(WrapperStruct00_var_1_8_Pointer)) - (*(WrapperStruct00_var_1_8_Pointer)))) : (((*(WrapperStruct00_var_1_8_Pointer)) - (*(WrapperStruct00_var_1_8_Pointer))))
             VAL         [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_15_Pointer={4:16}, WrapperStruct00_var_1_16_Pointer={4:17}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_18_Pointer={4:19}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:5}, isInitial=1]
[L109]       EXPR        ((*(WrapperStruct00_var_1_8_Pointer)) > (*(WrapperStruct00_var_1_8_Pointer))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed long int) ((((((*(WrapperStruct00_var_1_8_Pointer))) < ((*(WrapperStruct00_var_1_8_Pointer)))) ? ((*(WrapperStruct00_var_1_8_Pointer))) : ((*(WrapperStruct00_var_1_8_Pointer))))) - 10))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed long int) ((((((*(WrapperStruct00_var_1_8_Pointer)) - (*(WrapperStruct00_var_1_8_Pointer)))) > (((*(WrapperStruct00_var_1_8_Pointer)) - (*(WrapperStruct00_var_1_8_Pointer))))) ? (((*(WrapperStruct00_var_1_8_Pointer)) - (*(WrapperStruct00_var_1_8_Pointer)))) : (((*(WrapperStruct00_var_1_8_Pointer)) - (*(WrapperStruct00_var_1_8_Pointer))))))))
             VAL         [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_15_Pointer={4:16}, WrapperStruct00_var_1_16_Pointer={4:17}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_18_Pointer={4:19}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:5}, isInitial=1]
[L109]       EXPR        (((*(WrapperStruct00_var_1_8_Pointer)) > (*(WrapperStruct00_var_1_8_Pointer))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed long int) ((((((*(WrapperStruct00_var_1_8_Pointer))) < ((*(WrapperStruct00_var_1_8_Pointer)))) ? ((*(WrapperStruct00_var_1_8_Pointer))) : ((*(WrapperStruct00_var_1_8_Pointer))))) - 10))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed long int) ((((((*(WrapperStruct00_var_1_8_Pointer)) - (*(WrapperStruct00_var_1_8_Pointer)))) > (((*(WrapperStruct00_var_1_8_Pointer)) - (*(WrapperStruct00_var_1_8_Pointer))))) ? (((*(WrapperStruct00_var_1_8_Pointer)) - (*(WrapperStruct00_var_1_8_Pointer)))) : (((*(WrapperStruct00_var_1_8_Pointer)) - (*(WrapperStruct00_var_1_8_Pointer))))))))) && ((*(WrapperStruct00_var_1_8_Pointer)) == ((unsigned char) ((*(WrapperStruct00_var_1_9_Pointer)) + 100)))
[L109]       EXPR        \read(*WrapperStruct00_var_1_8_Pointer)
[L109]       EXPR        \read(*WrapperStruct00_var_1_9_Pointer)
[L109]       EXPR        (((*(WrapperStruct00_var_1_8_Pointer)) > (*(WrapperStruct00_var_1_8_Pointer))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed long int) ((((((*(WrapperStruct00_var_1_8_Pointer))) < ((*(WrapperStruct00_var_1_8_Pointer)))) ? ((*(WrapperStruct00_var_1_8_Pointer))) : ((*(WrapperStruct00_var_1_8_Pointer))))) - 10))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed long int) ((((((*(WrapperStruct00_var_1_8_Pointer)) - (*(WrapperStruct00_var_1_8_Pointer)))) > (((*(WrapperStruct00_var_1_8_Pointer)) - (*(WrapperStruct00_var_1_8_Pointer))))) ? (((*(WrapperStruct00_var_1_8_Pointer)) - (*(WrapperStruct00_var_1_8_Pointer)))) : (((*(WrapperStruct00_var_1_8_Pointer)) - (*(WrapperStruct00_var_1_8_Pointer))))))))) && ((*(WrapperStruct00_var_1_8_Pointer)) == ((unsigned char) ((*(WrapperStruct00_var_1_9_Pointer)) + 100)))
             VAL         [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_15_Pointer={4:16}, WrapperStruct00_var_1_16_Pointer={4:17}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_18_Pointer={4:19}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:5}, isInitial=1]
[L109]       EXPR        ((((*(WrapperStruct00_var_1_8_Pointer)) > (*(WrapperStruct00_var_1_8_Pointer))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed long int) ((((((*(WrapperStruct00_var_1_8_Pointer))) < ((*(WrapperStruct00_var_1_8_Pointer)))) ? ((*(WrapperStruct00_var_1_8_Pointer))) : ((*(WrapperStruct00_var_1_8_Pointer))))) - 10))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed long int) ((((((*(WrapperStruct00_var_1_8_Pointer)) - (*(WrapperStruct00_var_1_8_Pointer)))) > (((*(WrapperStruct00_var_1_8_Pointer)) - (*(WrapperStruct00_var_1_8_Pointer))))) ? (((*(WrapperStruct00_var_1_8_Pointer)) - (*(WrapperStruct00_var_1_8_Pointer)))) : (((*(WrapperStruct00_var_1_8_Pointer)) - (*(WrapperStruct00_var_1_8_Pointer))))))))) && ((*(WrapperStruct00_var_1_8_Pointer)) == ((unsigned char) ((*(WrapperStruct00_var_1_9_Pointer)) + 100)))) && ((*(WrapperStruct00_var_1_10_Pointer)) == ((float) (((((*(WrapperStruct00_var_1_11_Pointer))) < (64.15f)) ? ((*(WrapperStruct00_var_1_11_Pointer))) : (64.15f)))))
[L109]       EXPR        \read(*WrapperStruct00_var_1_10_Pointer)
[L109]       EXPR        \read(*WrapperStruct00_var_1_11_Pointer)
             VAL         [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_15_Pointer={4:16}, WrapperStruct00_var_1_16_Pointer={4:17}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_18_Pointer={4:19}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:5}, isInitial=1]
[L109]       EXPR        (((*(WrapperStruct00_var_1_11_Pointer))) < (64.15f)) ? ((*(WrapperStruct00_var_1_11_Pointer))) : (64.15f)
             VAL         [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_15_Pointer={4:16}, WrapperStruct00_var_1_16_Pointer={4:17}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_18_Pointer={4:19}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:5}, isInitial=1]
[L109]       EXPR        ((((*(WrapperStruct00_var_1_8_Pointer)) > (*(WrapperStruct00_var_1_8_Pointer))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed long int) ((((((*(WrapperStruct00_var_1_8_Pointer))) < ((*(WrapperStruct00_var_1_8_Pointer)))) ? ((*(WrapperStruct00_var_1_8_Pointer))) : ((*(WrapperStruct00_var_1_8_Pointer))))) - 10))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed long int) ((((((*(WrapperStruct00_var_1_8_Pointer)) - (*(WrapperStruct00_var_1_8_Pointer)))) > (((*(WrapperStruct00_var_1_8_Pointer)) - (*(WrapperStruct00_var_1_8_Pointer))))) ? (((*(WrapperStruct00_var_1_8_Pointer)) - (*(WrapperStruct00_var_1_8_Pointer)))) : (((*(WrapperStruct00_var_1_8_Pointer)) - (*(WrapperStruct00_var_1_8_Pointer))))))))) && ((*(WrapperStruct00_var_1_8_Pointer)) == ((unsigned char) ((*(WrapperStruct00_var_1_9_Pointer)) + 100)))) && ((*(WrapperStruct00_var_1_10_Pointer)) == ((float) (((((*(WrapperStruct00_var_1_11_Pointer))) < (64.15f)) ? ((*(WrapperStruct00_var_1_11_Pointer))) : (64.15f)))))
             VAL         [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_15_Pointer={4:16}, WrapperStruct00_var_1_16_Pointer={4:17}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_18_Pointer={4:19}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:5}, isInitial=1]
[L109]       EXPR        (((((*(WrapperStruct00_var_1_8_Pointer)) > (*(WrapperStruct00_var_1_8_Pointer))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed long int) ((((((*(WrapperStruct00_var_1_8_Pointer))) < ((*(WrapperStruct00_var_1_8_Pointer)))) ? ((*(WrapperStruct00_var_1_8_Pointer))) : ((*(WrapperStruct00_var_1_8_Pointer))))) - 10))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed long int) ((((((*(WrapperStruct00_var_1_8_Pointer)) - (*(WrapperStruct00_var_1_8_Pointer)))) > (((*(WrapperStruct00_var_1_8_Pointer)) - (*(WrapperStruct00_var_1_8_Pointer))))) ? (((*(WrapperStruct00_var_1_8_Pointer)) - (*(WrapperStruct00_var_1_8_Pointer)))) : (((*(WrapperStruct00_var_1_8_Pointer)) - (*(WrapperStruct00_var_1_8_Pointer))))))))) && ((*(WrapperStruct00_var_1_8_Pointer)) == ((unsigned char) ((*(WrapperStruct00_var_1_9_Pointer)) + 100)))) && ((*(WrapperStruct00_var_1_10_Pointer)) == ((float) (((((*(WrapperStruct00_var_1_11_Pointer))) < (64.15f)) ? ((*(WrapperStruct00_var_1_11_Pointer))) : (64.15f)))))) && (((- (*(WrapperStruct00_var_1_10_Pointer))) > (*(WrapperStruct00_var_1_11_Pointer))) ? ((*(WrapperStruct00_var_1_12_Pointer)) == ((unsigned char) ((*(WrapperStruct00_var_1_13_Pointer)) || ((*(WrapperStruct00_var_1_17_Pointer)) && ((*(WrapperStruct00_var_1_15_Pointer)) || (*(WrapperStruct00_var_1_16_Pointer))))))) : ((*(WrapperStruct00_var_1_12_Pointer)) == ((unsigned char) (((*(WrapperStruct00_var_1_1_Pointer)) <= (*(WrapperStruct00_var_1_9_Pointer))) && (*(WrapperStruct00_var_1_16_Pointer))))))
             VAL         [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_15_Pointer={4:16}, WrapperStruct00_var_1_16_Pointer={4:17}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_18_Pointer={4:19}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:5}, isInitial=1]
[L109]       EXPR        ((((((*(WrapperStruct00_var_1_8_Pointer)) > (*(WrapperStruct00_var_1_8_Pointer))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed long int) ((((((*(WrapperStruct00_var_1_8_Pointer))) < ((*(WrapperStruct00_var_1_8_Pointer)))) ? ((*(WrapperStruct00_var_1_8_Pointer))) : ((*(WrapperStruct00_var_1_8_Pointer))))) - 10))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed long int) ((((((*(WrapperStruct00_var_1_8_Pointer)) - (*(WrapperStruct00_var_1_8_Pointer)))) > (((*(WrapperStruct00_var_1_8_Pointer)) - (*(WrapperStruct00_var_1_8_Pointer))))) ? (((*(WrapperStruct00_var_1_8_Pointer)) - (*(WrapperStruct00_var_1_8_Pointer)))) : (((*(WrapperStruct00_var_1_8_Pointer)) - (*(WrapperStruct00_var_1_8_Pointer))))))))) && ((*(WrapperStruct00_var_1_8_Pointer)) == ((unsigned char) ((*(WrapperStruct00_var_1_9_Pointer)) + 100)))) && ((*(WrapperStruct00_var_1_10_Pointer)) == ((float) (((((*(WrapperStruct00_var_1_11_Pointer))) < (64.15f)) ? ((*(WrapperStruct00_var_1_11_Pointer))) : (64.15f)))))) && (((- (*(WrapperStruct00_var_1_10_Pointer))) > (*(WrapperStruct00_var_1_11_Pointer))) ? ((*(WrapperStruct00_var_1_12_Pointer)) == ((unsigned char) ((*(WrapperStruct00_var_1_13_Pointer)) || ((*(WrapperStruct00_var_1_17_Pointer)) && ((*(WrapperStruct00_var_1_15_Pointer)) || (*(WrapperStruct00_var_1_16_Pointer))))))) : ((*(WrapperStruct00_var_1_12_Pointer)) == ((unsigned char) (((*(WrapperStruct00_var_1_1_Pointer)) <= (*(WrapperStruct00_var_1_9_Pointer))) && (*(WrapperStruct00_var_1_16_Pointer))))))) && (((*(WrapperStruct00_var_1_11_Pointer)) <= (*(WrapperStruct00_var_1_10_Pointer))) ? (((*(WrapperStruct00_var_1_1_Pointer)) != (*(WrapperStruct00_var_1_8_Pointer))) ? ((*(WrapperStruct00_var_1_17_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_18_Pointer)))) : 1) : (((*(WrapperStruct00_var_1_8_Pointer)) <= 1000000) ? ((*(WrapperStruct00_var_1_17_Pointer)) == ((unsigned char) 0)) : ((*(WrapperStruct00_var_1_17_Pointer)) == ((unsigned char) 0))))
             VAL         [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_15_Pointer={4:16}, WrapperStruct00_var_1_16_Pointer={4:17}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_18_Pointer={4:19}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:5}, isInitial=1]
[L109-L110]              return ((((((*(WrapperStruct00_var_1_8_Pointer)) > (*(WrapperStruct00_var_1_8_Pointer))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed long int) ((((((*(WrapperStruct00_var_1_8_Pointer))) < ((*(WrapperStruct00_var_1_8_Pointer)))) ? ((*(WrapperStruct00_var_1_8_Pointer))) : ((*(WrapperStruct00_var_1_8_Pointer))))) - 10))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed long int) ((((((*(WrapperStruct00_var_1_8_Pointer)) - (*(WrapperStruct00_var_1_8_Pointer)))) > (((*(WrapperStruct00_var_1_8_Pointer)) - (*(WrapperStruct00_var_1_8_Pointer))))) ? (((*(WrapperStruct00_var_1_8_Pointer)) - (*(WrapperStruct00_var_1_8_Pointer)))) : (((*(WrapperStruct00_var_1_8_Pointer)) - (*(WrapperStruct00_var_1_8_Pointer))))))))) && ((*(WrapperStruct00_var_1_8_Pointer)) == ((unsigned char) ((*(WrapperStruct00_var_1_9_Pointer)) + 100)))) && ((*(WrapperStruct00_var_1_10_Pointer)) == ((float) (((((*(WrapperStruct00_var_1_11_Pointer))) < (64.15f)) ? ((*(WrapperStruct00_var_1_11_Pointer))) : (64.15f)))))) && (((- (*(WrapperStruct00_var_1_10_Pointer))) > (*(WrapperStruct00_var_1_11_Pointer))) ? ((*(WrapperStruct00_var_1_12_Pointer)) == ((unsigned char) ((*(WrapperStruct00_var_1_13_Pointer)) || ((*(WrapperStruct00_var_1_17_Pointer)) && ((*(WrapperStruct00_var_1_15_Pointer)) || (*(WrapperStruct00_var_1_16_Pointer))))))) : ((*(WrapperStruct00_var_1_12_Pointer)) == ((unsigned char) (((*(WrapperStruct00_var_1_1_Pointer)) <= (*(WrapperStruct00_var_1_9_Pointer))) && (*(WrapperStruct00_var_1_16_Pointer))))))) && (((*(WrapperStruct00_var_1_11_Pointer)) <= (*(WrapperStruct00_var_1_10_Pointer))) ? (((*(WrapperStruct00_var_1_1_Pointer)) != (*(WrapperStruct00_var_1_8_Pointer))) ? ((*(WrapperStruct00_var_1_17_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_18_Pointer)))) : 1) : (((*(WrapperStruct00_var_1_8_Pointer)) <= 1000000) ? ((*(WrapperStruct00_var_1_17_Pointer)) == ((unsigned char) 0)) : ((*(WrapperStruct00_var_1_17_Pointer)) == ((unsigned char) 0))))
;
[L119]       RET, EXPR   property()
[L119]       CALL        __VERIFIER_assert(property())
[L19]        COND TRUE   !(cond)
             VAL         [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_15_Pointer={4:16}, WrapperStruct00_var_1_16_Pointer={4:17}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_18_Pointer={4:19}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:5}, isInitial=1]
[L19]                    reach_error()
             VAL         [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_15_Pointer={4:16}, WrapperStruct00_var_1_16_Pointer={4:17}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_18_Pointer={4:19}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:5}, isInitial=1]

  - StatisticsResult: Ultimate Automizer benchmark data
    CFG has 2 procedures, 100 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 16.2s, OverallIterations: 9, TraceHistogramMax: 11, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 705 SdHoareTripleChecker+Valid, 1.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 704 mSDsluCounter, 2767 SdHoareTripleChecker+Invalid, 1.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1895 mSDsCounter, 63 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1480 IncrementalHoareTripleChecker+Invalid, 1543 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 63 mSolverCounterUnsat, 872 mSDtfsCounter, 1480 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 208 GetRequests, 142 SyntacticMatches, 2 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 234 ImplicationChecksByTransitivity, 2.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=175occurred in iteration=6, InterpolantAutomatonStates: 47, 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, 8 MinimizatonAttempts, 86 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 11.5s InterpolantComputationTime, 1032 NumberOfCodeBlocks, 1032 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 918 ConstructedInterpolants, 0 QuantifiedInterpolants, 10562 SizeOfPredicates, 0 NumberOfNonLiveVariables, 452 ConjunctsInSsa, 1 ConjunctsInUnsatCore, 9 InterpolantComputations, 8 PerfectInterpolantSequences, 1960/1980 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-19 01:17:51,764 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_variablewrapping_wrapper-sp_file-42.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 3d976df0441559782faf2252bd19993d5a8987fee3e7cd12d006e6d9859f8f01
--- Real Ultimate output ---
This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m
[2024-11-19 01:17:54,544 INFO  L188        SettingsManager]: Resetting all preferences to default values...
[2024-11-19 01:17:54,620 INFO  L114        SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf
[2024-11-19 01:17:54,626 WARN  L101        SettingsManager]: Preference file contains the following unknown settings:
[2024-11-19 01:17:54,626 WARN  L103        SettingsManager]:   * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2024-11-19 01:17:54,650 INFO  L130        SettingsManager]: Preferences different from defaults after loading the file:
[2024-11-19 01:17:54,651 INFO  L151        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2024-11-19 01:17:54,653 INFO  L153        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2024-11-19 01:17:54,654 INFO  L151        SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults:
[2024-11-19 01:17:54,654 INFO  L153        SettingsManager]:  * Use memory slicer=true
[2024-11-19 01:17:54,655 INFO  L151        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2024-11-19 01:17:54,655 INFO  L153        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2024-11-19 01:17:54,655 INFO  L151        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2024-11-19 01:17:54,657 INFO  L153        SettingsManager]:  * Create parallel compositions if possible=false
[2024-11-19 01:17:54,657 INFO  L153        SettingsManager]:  * Use SBE=true
[2024-11-19 01:17:54,657 INFO  L151        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2024-11-19 01:17:54,658 INFO  L153        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2024-11-19 01:17:54,658 INFO  L153        SettingsManager]:  * sizeof long=4
[2024-11-19 01:17:54,660 INFO  L153        SettingsManager]:  * sizeof POINTER=4
[2024-11-19 01:17:54,660 INFO  L153        SettingsManager]:  * Check division by zero=IGNORE
[2024-11-19 01:17:54,660 INFO  L153        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2024-11-19 01:17:54,661 INFO  L153        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2024-11-19 01:17:54,661 INFO  L153        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2024-11-19 01:17:54,661 INFO  L153        SettingsManager]:  * Adapt memory model on pointer casts if necessary=true
[2024-11-19 01:17:54,661 INFO  L153        SettingsManager]:  * Use bitvectors instead of ints=true
[2024-11-19 01:17:54,662 INFO  L153        SettingsManager]:  * Allow undefined functions=false
[2024-11-19 01:17:54,662 INFO  L153        SettingsManager]:  * Memory model=HoenickeLindenmann_4ByteResolution
[2024-11-19 01:17:54,662 INFO  L153        SettingsManager]:  * sizeof long double=12
[2024-11-19 01:17:54,663 INFO  L153        SettingsManager]:  * Check if freed pointer was valid=false
[2024-11-19 01:17:54,663 INFO  L153        SettingsManager]:  * Use constant arrays=true
[2024-11-19 01:17:54,663 INFO  L151        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2024-11-19 01:17:54,663 INFO  L153        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2024-11-19 01:17:54,664 INFO  L153        SettingsManager]:  * Only consider context switches at boundaries of atomic blocks=true
[2024-11-19 01:17:54,664 INFO  L153        SettingsManager]:  * SMT solver=External_DefaultMode
[2024-11-19 01:17:54,664 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-11-19 01:17:54,664 INFO  L151        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2024-11-19 01:17:54,665 INFO  L153        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2024-11-19 01:17:54,665 INFO  L153        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopHeads
[2024-11-19 01:17:54,665 INFO  L153        SettingsManager]:  * Trace refinement strategy=WOLF
[2024-11-19 01:17:54,665 INFO  L153        SettingsManager]:  * Command for external solver=cvc4 --incremental --print-success --lang smt
[2024-11-19 01:17:54,666 INFO  L153        SettingsManager]:  * Apply one-shot large block encoding in concurrent analysis=false
[2024-11-19 01:17:54,666 INFO  L153        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2024-11-19 01:17:54,666 INFO  L153        SettingsManager]:  * Order on configurations for Petri net unfoldings=DBO
[2024-11-19 01:17:54,666 INFO  L153        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2024-11-19 01:17:54,666 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 -> 3d976df0441559782faf2252bd19993d5a8987fee3e7cd12d006e6d9859f8f01
[2024-11-19 01:17:55,045 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2024-11-19 01:17:55,093 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2024-11-19 01:17:55,095 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2024-11-19 01:17:55,096 INFO  L270        PluginConnector]: Initializing CDTParser...
[2024-11-19 01:17:55,102 INFO  L274        PluginConnector]: CDTParser initialized
[2024-11-19 01:17:55,104 INFO  L431   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-42.i
[2024-11-19 01:17:56,829 INFO  L533              CDTParser]: Created temporary CDT project at NULL
[2024-11-19 01:17:57,018 INFO  L384              CDTParser]: Found 1 translation units.
[2024-11-19 01:17:57,021 INFO  L180              CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-42.i
[2024-11-19 01:17:57,030 INFO  L427              CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9c34c6f87/42aaeb26d7cf4e2f8ea33d17e17644fb/FLAG8c0b400e3
[2024-11-19 01:17:57,377 INFO  L435              CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9c34c6f87/42aaeb26d7cf4e2f8ea33d17e17644fb
[2024-11-19 01:17:57,380 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2024-11-19 01:17:57,381 INFO  L133        ToolchainWalker]: Walking toolchain with 6 elements.
[2024-11-19 01:17:57,382 INFO  L112        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2024-11-19 01:17:57,382 INFO  L270        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2024-11-19 01:17:57,387 INFO  L274        PluginConnector]: CACSL2BoogieTranslator initialized
[2024-11-19 01:17:57,388 INFO  L184        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 01:17:57" (1/1) ...
[2024-11-19 01:17:57,390 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5b3195f6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:17:57, skipping insertion in model container
[2024-11-19 01:17:57,390 INFO  L184        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 01:17:57" (1/1) ...
[2024-11-19 01:17:57,413 INFO  L175         MainTranslator]: Built tables and reachable declarations
[2024-11-19 01:17:57,579 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_variablewrapping_wrapper-sp_file-42.i[917,930]
[2024-11-19 01:17:57,649 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2024-11-19 01:17:57,672 INFO  L200         MainTranslator]: Completed pre-run
[2024-11-19 01:17:57,682 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_variablewrapping_wrapper-sp_file-42.i[917,930]
[2024-11-19 01:17:57,732 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2024-11-19 01:17:57,761 INFO  L204         MainTranslator]: Completed translation
[2024-11-19 01:17:57,762 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:17:57 WrapperNode
[2024-11-19 01:17:57,762 INFO  L131        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2024-11-19 01:17:57,763 INFO  L112        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2024-11-19 01:17:57,763 INFO  L270        PluginConnector]: Initializing Boogie Procedure Inliner...
[2024-11-19 01:17:57,764 INFO  L274        PluginConnector]: Boogie Procedure Inliner initialized
[2024-11-19 01:17:57,769 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:17:57" (1/1) ...
[2024-11-19 01:17:57,791 INFO  L184        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:17:57" (1/1) ...
[2024-11-19 01:17:57,831 INFO  L138                Inliner]: procedures = 34, calls = 138, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 446
[2024-11-19 01:17:57,835 INFO  L131        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2024-11-19 01:17:57,836 INFO  L112        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2024-11-19 01:17:57,836 INFO  L270        PluginConnector]: Initializing Boogie Preprocessor...
[2024-11-19 01:17:57,836 INFO  L274        PluginConnector]: Boogie Preprocessor initialized
[2024-11-19 01:17:57,849 INFO  L184        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:17:57" (1/1) ...
[2024-11-19 01:17:57,849 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:17:57" (1/1) ...
[2024-11-19 01:17:57,854 INFO  L184        PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:17:57" (1/1) ...
[2024-11-19 01:17:57,885 INFO  L175           MemorySlicer]: Split 116 memory accesses to 2 slices as follows [2, 114]. 98 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 27 writes are split as follows [0, 27].
[2024-11-19 01:17:57,889 INFO  L184        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:17:57" (1/1) ...
[2024-11-19 01:17:57,890 INFO  L184        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:17:57" (1/1) ...
[2024-11-19 01:17:57,911 INFO  L184        PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:17:57" (1/1) ...
[2024-11-19 01:17:57,915 INFO  L184        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:17:57" (1/1) ...
[2024-11-19 01:17:57,921 INFO  L184        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:17:57" (1/1) ...
[2024-11-19 01:17:57,927 INFO  L184        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:17:57" (1/1) ...
[2024-11-19 01:17:57,933 INFO  L131        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2024-11-19 01:17:57,937 INFO  L112        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2024-11-19 01:17:57,938 INFO  L270        PluginConnector]: Initializing RCFGBuilder...
[2024-11-19 01:17:57,938 INFO  L274        PluginConnector]: RCFGBuilder initialized
[2024-11-19 01:17:57,939 INFO  L184        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:17:57" (1/1) ...
[2024-11-19 01:17:57,944 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-11-19 01:17:57,955 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2024-11-19 01:17:57,974 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-19 01:17:57,985 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-19 01:17:58,030 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2024-11-19 01:17:58,031 INFO  L130     BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0
[2024-11-19 01:17:58,031 INFO  L130     BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1
[2024-11-19 01:17:58,031 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0
[2024-11-19 01:17:58,031 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1
[2024-11-19 01:17:58,031 INFO  L130     BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#0
[2024-11-19 01:17:58,034 INFO  L130     BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#1
[2024-11-19 01:17:58,034 INFO  L130     BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0
[2024-11-19 01:17:58,034 INFO  L130     BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1
[2024-11-19 01:17:58,034 INFO  L130     BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4#0
[2024-11-19 01:17:58,035 INFO  L130     BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4#1
[2024-11-19 01:17:58,035 INFO  L130     BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#0
[2024-11-19 01:17:58,035 INFO  L130     BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#1
[2024-11-19 01:17:58,035 INFO  L130     BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1#0
[2024-11-19 01:17:58,035 INFO  L130     BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1#1
[2024-11-19 01:17:58,035 INFO  L130     BoogieDeclarations]: Found specification of procedure assume_abort_if_not
[2024-11-19 01:17:58,035 INFO  L138     BoogieDeclarations]: Found implementation of procedure assume_abort_if_not
[2024-11-19 01:17:58,035 INFO  L130     BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE4#0
[2024-11-19 01:17:58,035 INFO  L130     BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE4#1
[2024-11-19 01:17:58,036 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2024-11-19 01:17:58,036 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2024-11-19 01:17:58,036 INFO  L130     BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0
[2024-11-19 01:17:58,036 INFO  L130     BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1
[2024-11-19 01:17:58,036 INFO  L130     BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0
[2024-11-19 01:17:58,036 INFO  L130     BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1
[2024-11-19 01:17:58,166 INFO  L238             CfgBuilder]: Building ICFG
[2024-11-19 01:17:58,168 INFO  L264             CfgBuilder]: Building CFG for each procedure with an implementation
[2024-11-19 01:17:58,880 INFO  L?                        ?]: Removed 122 outVars from TransFormulas that were not future-live.
[2024-11-19 01:17:58,880 INFO  L287             CfgBuilder]: Performing block encoding
[2024-11-19 01:17:58,893 INFO  L311             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2024-11-19 01:17:58,893 INFO  L316             CfgBuilder]: Removed 1 assume(true) statements.
[2024-11-19 01:17:58,894 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 01:17:58 BoogieIcfgContainer
[2024-11-19 01:17:58,894 INFO  L131        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2024-11-19 01:17:58,896 INFO  L112        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2024-11-19 01:17:58,897 INFO  L270        PluginConnector]: Initializing TraceAbstraction...
[2024-11-19 01:17:58,899 INFO  L274        PluginConnector]: TraceAbstraction initialized
[2024-11-19 01:17:58,900 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 01:17:57" (1/3) ...
[2024-11-19 01:17:58,901 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@10af930a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 01:17:58, skipping insertion in model container
[2024-11-19 01:17:58,901 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:17:57" (2/3) ...
[2024-11-19 01:17:58,901 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@10af930a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 01:17:58, skipping insertion in model container
[2024-11-19 01:17:58,901 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 01:17:58" (3/3) ...
[2024-11-19 01:17:58,903 INFO  L112   eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-sp_file-42.i
[2024-11-19 01:17:58,917 INFO  L214   ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2024-11-19 01:17:58,917 INFO  L154   ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations.
[2024-11-19 01:17:59,009 INFO  L332      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2024-11-19 01:17:59,016 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;@53c3ff20, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2024-11-19 01:17:59,017 INFO  L334      AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2024-11-19 01:17:59,022 INFO  L276                IsEmpty]: Start isEmpty. Operand  has 100 states, 86 states have (on average 1.4186046511627908) internal successors, (122), 87 states have internal predecessors, (122), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11)
[2024-11-19 01:17:59,032 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 104
[2024-11-19 01:17:59,033 INFO  L207           NwaCegarLoop]: Found error trace
[2024-11-19 01:17:59,034 INFO  L215           NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 01:17:59,034 INFO  L396      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-19 01:17:59,040 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-19 01:17:59,041 INFO  L85        PathProgramCache]: Analyzing trace with hash 990451809, now seen corresponding path program 1 times
[2024-11-19 01:17:59,055 INFO  L118   FreeRefinementEngine]: Executing refinement strategy WOLF
[2024-11-19 01:17:59,056 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1868076234]
[2024-11-19 01:17:59,056 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-19 01:17:59,057 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-19 01:17:59,057 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat
[2024-11-19 01:17:59,063 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-19 01:17:59,066 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-19 01:17:59,306 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-19 01:17:59,314 INFO  L255         TraceCheckSpWp]: Trace formula consists of 247 conjuncts, 1 conjuncts are in the unsatisfiable core
[2024-11-19 01:17:59,320 INFO  L278         TraceCheckSpWp]: Computing forward predicates...
[2024-11-19 01:17:59,349 INFO  L134       CoverageAnalysis]: Checked inductivity of 220 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked.
[2024-11-19 01:17:59,349 INFO  L307         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-11-19 01:17:59,350 INFO  L136   FreeRefinementEngine]: Strategy WOLF found an infeasible trace
[2024-11-19 01:17:59,350 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1868076234]
[2024-11-19 01:17:59,350 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleMathsat [1868076234] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-19 01:17:59,350 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-19 01:17:59,351 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-11-19 01:17:59,352 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [176751026]
[2024-11-19 01:17:59,353 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-19 01:17:59,356 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 2 states
[2024-11-19 01:17:59,356 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF
[2024-11-19 01:17:59,377 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants.
[2024-11-19 01:17:59,378 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2024-11-19 01:17:59,381 INFO  L87              Difference]: Start difference. First operand  has 100 states, 86 states have (on average 1.4186046511627908) internal successors, (122), 87 states have internal predecessors, (122), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand  has 2 states, 2 states have (on average 26.5) internal successors, (53), 2 states have internal predecessors, (53), 1 states have call successors, (11), 1 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 1 states have call successors, (11)
[2024-11-19 01:17:59,418 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-19 01:17:59,423 INFO  L93              Difference]: Finished difference Result 193 states and 293 transitions.
[2024-11-19 01:17:59,424 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. 
[2024-11-19 01:17:59,425 INFO  L78                 Accepts]: Start accepts. Automaton has  has 2 states, 2 states have (on average 26.5) internal successors, (53), 2 states have internal predecessors, (53), 1 states have call successors, (11), 1 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 1 states have call successors, (11) Word has length 103
[2024-11-19 01:17:59,426 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-19 01:17:59,440 INFO  L225             Difference]: With dead ends: 193
[2024-11-19 01:17:59,440 INFO  L226             Difference]: Without dead ends: 96
[2024-11-19 01:17:59,447 INFO  L431           NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 102 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-19 01:17:59,455 INFO  L432           NwaCegarLoop]: 135 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, 135 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-19 01:17:59,456 INFO  L433           NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2024-11-19 01:17:59,469 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 96 states.
[2024-11-19 01:17:59,498 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96.
[2024-11-19 01:17:59,502 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 96 states, 83 states have (on average 1.3614457831325302) internal successors, (113), 83 states have internal predecessors, (113), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11)
[2024-11-19 01:17:59,504 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 135 transitions.
[2024-11-19 01:17:59,507 INFO  L78                 Accepts]: Start accepts. Automaton has 96 states and 135 transitions. Word has length 103
[2024-11-19 01:17:59,507 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-11-19 01:17:59,508 INFO  L471      AbstractCegarLoop]: Abstraction has 96 states and 135 transitions.
[2024-11-19 01:17:59,508 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 2 states, 2 states have (on average 26.5) internal successors, (53), 2 states have internal predecessors, (53), 1 states have call successors, (11), 1 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 1 states have call successors, (11)
[2024-11-19 01:17:59,508 INFO  L276                IsEmpty]: Start isEmpty. Operand 96 states and 135 transitions.
[2024-11-19 01:17:59,515 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 104
[2024-11-19 01:17:59,516 INFO  L207           NwaCegarLoop]: Found error trace
[2024-11-19 01:17:59,516 INFO  L215           NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 01:17:59,527 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-19 01:17:59,718 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-19 01:17:59,719 INFO  L396      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-19 01:17:59,720 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-19 01:17:59,722 INFO  L85        PathProgramCache]: Analyzing trace with hash -214908817, now seen corresponding path program 1 times
[2024-11-19 01:17:59,723 INFO  L118   FreeRefinementEngine]: Executing refinement strategy WOLF
[2024-11-19 01:17:59,723 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1982178787]
[2024-11-19 01:17:59,723 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-19 01:17:59,724 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-19 01:17:59,724 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat
[2024-11-19 01:17:59,725 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-19 01:17:59,727 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-19 01:17:59,990 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-19 01:17:59,996 INFO  L255         TraceCheckSpWp]: Trace formula consists of 247 conjuncts, 3 conjuncts are in the unsatisfiable core
[2024-11-19 01:17:59,999 INFO  L278         TraceCheckSpWp]: Computing forward predicates...
[2024-11-19 01:18:00,040 INFO  L134       CoverageAnalysis]: Checked inductivity of 220 backedges. 72 proven. 0 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked.
[2024-11-19 01:18:00,040 INFO  L307         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-11-19 01:18:00,040 INFO  L136   FreeRefinementEngine]: Strategy WOLF found an infeasible trace
[2024-11-19 01:18:00,041 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1982178787]
[2024-11-19 01:18:00,041 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleMathsat [1982178787] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-19 01:18:00,041 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-19 01:18:00,041 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2024-11-19 01:18:00,041 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1195451362]
[2024-11-19 01:18:00,041 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-19 01:18:00,042 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2024-11-19 01:18:00,042 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF
[2024-11-19 01:18:00,043 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2024-11-19 01:18:00,043 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2024-11-19 01:18:00,043 INFO  L87              Difference]: Start difference. First operand 96 states and 135 transitions. Second operand  has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11)
[2024-11-19 01:18:00,085 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-19 01:18:00,085 INFO  L93              Difference]: Finished difference Result 191 states and 270 transitions.
[2024-11-19 01:18:00,086 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2024-11-19 01:18:00,086 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 103
[2024-11-19 01:18:00,086 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-19 01:18:00,087 INFO  L225             Difference]: With dead ends: 191
[2024-11-19 01:18:00,087 INFO  L226             Difference]: Without dead ends: 98
[2024-11-19 01:18:00,088 INFO  L431           NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2024-11-19 01:18:00,089 INFO  L432           NwaCegarLoop]: 133 mSDtfsCounter, 0 mSDsluCounter, 255 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 388 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2024-11-19 01:18:00,089 INFO  L433           NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 388 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2024-11-19 01:18:00,089 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 98 states.
[2024-11-19 01:18:00,099 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98.
[2024-11-19 01:18:00,099 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 98 states, 85 states have (on average 1.3529411764705883) internal successors, (115), 85 states have internal predecessors, (115), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11)
[2024-11-19 01:18:00,100 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 137 transitions.
[2024-11-19 01:18:00,100 INFO  L78                 Accepts]: Start accepts. Automaton has 98 states and 137 transitions. Word has length 103
[2024-11-19 01:18:00,101 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-11-19 01:18:00,101 INFO  L471      AbstractCegarLoop]: Abstraction has 98 states and 137 transitions.
[2024-11-19 01:18:00,102 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11)
[2024-11-19 01:18:00,102 INFO  L276                IsEmpty]: Start isEmpty. Operand 98 states and 137 transitions.
[2024-11-19 01:18:00,103 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 104
[2024-11-19 01:18:00,103 INFO  L207           NwaCegarLoop]: Found error trace
[2024-11-19 01:18:00,103 INFO  L215           NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 01:18:00,111 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-19 01:18:00,306 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-19 01:18:00,307 INFO  L396      AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-19 01:18:00,307 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-19 01:18:00,308 INFO  L85        PathProgramCache]: Analyzing trace with hash 1743665969, now seen corresponding path program 1 times
[2024-11-19 01:18:00,308 INFO  L118   FreeRefinementEngine]: Executing refinement strategy WOLF
[2024-11-19 01:18:00,308 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1612830439]
[2024-11-19 01:18:00,308 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-19 01:18:00,308 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-19 01:18:00,309 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat
[2024-11-19 01:18:00,311 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-19 01:18:00,312 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-19 01:18:00,470 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-19 01:18:00,476 INFO  L255         TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 6 conjuncts are in the unsatisfiable core
[2024-11-19 01:18:00,480 INFO  L278         TraceCheckSpWp]: Computing forward predicates...
[2024-11-19 01:18:00,585 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 17
[2024-11-19 01:18:00,640 INFO  L134       CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked.
[2024-11-19 01:18:00,640 INFO  L307         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-11-19 01:18:00,640 INFO  L136   FreeRefinementEngine]: Strategy WOLF found an infeasible trace
[2024-11-19 01:18:00,640 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1612830439]
[2024-11-19 01:18:00,640 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleMathsat [1612830439] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-19 01:18:00,640 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-19 01:18:00,640 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-11-19 01:18:00,640 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [850434285]
[2024-11-19 01:18:00,641 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-19 01:18:00,641 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-11-19 01:18:00,641 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF
[2024-11-19 01:18:00,641 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-11-19 01:18:00,642 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-19 01:18:00,642 INFO  L87              Difference]: Start difference. First operand 98 states and 137 transitions. Second operand  has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11)
[2024-11-19 01:18:00,662 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-19 01:18:00,662 INFO  L93              Difference]: Finished difference Result 193 states and 271 transitions.
[2024-11-19 01:18:00,662 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-11-19 01:18:00,662 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 103
[2024-11-19 01:18:00,663 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-19 01:18:00,663 INFO  L225             Difference]: With dead ends: 193
[2024-11-19 01:18:00,663 INFO  L226             Difference]: Without dead ends: 98
[2024-11-19 01:18:00,664 INFO  L431           NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 101 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-19 01:18:00,665 INFO  L432           NwaCegarLoop]: 133 mSDtfsCounter, 0 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 262 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2024-11-19 01:18:00,665 INFO  L433           NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 262 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2024-11-19 01:18:00,665 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 98 states.
[2024-11-19 01:18:00,669 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98.
[2024-11-19 01:18:00,670 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 98 states, 85 states have (on average 1.3411764705882352) internal successors, (114), 85 states have internal predecessors, (114), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11)
[2024-11-19 01:18:00,671 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 136 transitions.
[2024-11-19 01:18:00,671 INFO  L78                 Accepts]: Start accepts. Automaton has 98 states and 136 transitions. Word has length 103
[2024-11-19 01:18:00,674 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-11-19 01:18:00,674 INFO  L471      AbstractCegarLoop]: Abstraction has 98 states and 136 transitions.
[2024-11-19 01:18:00,674 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11)
[2024-11-19 01:18:00,675 INFO  L276                IsEmpty]: Start isEmpty. Operand 98 states and 136 transitions.
[2024-11-19 01:18:00,675 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 104
[2024-11-19 01:18:00,675 INFO  L207           NwaCegarLoop]: Found error trace
[2024-11-19 01:18:00,676 INFO  L215           NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 01:18:00,683 INFO  L540       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0
[2024-11-19 01:18:00,876 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2024-11-19 01:18:00,877 INFO  L396      AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-19 01:18:00,877 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-19 01:18:00,877 INFO  L85        PathProgramCache]: Analyzing trace with hash 1884214579, now seen corresponding path program 1 times
[2024-11-19 01:18:00,878 INFO  L118   FreeRefinementEngine]: Executing refinement strategy WOLF
[2024-11-19 01:18:00,878 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1101665491]
[2024-11-19 01:18:00,878 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-19 01:18:00,878 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-19 01:18:00,878 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat
[2024-11-19 01:18:00,881 INFO  L229       MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null)
[2024-11-19 01:18:00,882 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process
[2024-11-19 01:18:01,084 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-19 01:18:01,091 INFO  L255         TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 5 conjuncts are in the unsatisfiable core
[2024-11-19 01:18:01,094 INFO  L278         TraceCheckSpWp]: Computing forward predicates...
[2024-11-19 01:18:01,121 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 17
[2024-11-19 01:18:01,146 INFO  L134       CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked.
[2024-11-19 01:18:01,146 INFO  L307         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-11-19 01:18:01,146 INFO  L136   FreeRefinementEngine]: Strategy WOLF found an infeasible trace
[2024-11-19 01:18:01,146 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1101665491]
[2024-11-19 01:18:01,146 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleMathsat [1101665491] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-19 01:18:01,147 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-19 01:18:01,147 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-11-19 01:18:01,147 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2081829084]
[2024-11-19 01:18:01,147 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-19 01:18:01,147 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-11-19 01:18:01,147 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF
[2024-11-19 01:18:01,148 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-11-19 01:18:01,148 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-19 01:18:01,148 INFO  L87              Difference]: Start difference. First operand 98 states and 136 transitions. Second operand  has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11)
[2024-11-19 01:18:01,166 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-19 01:18:01,166 INFO  L93              Difference]: Finished difference Result 193 states and 269 transitions.
[2024-11-19 01:18:01,166 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-11-19 01:18:01,167 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 103
[2024-11-19 01:18:01,167 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-19 01:18:01,168 INFO  L225             Difference]: With dead ends: 193
[2024-11-19 01:18:01,168 INFO  L226             Difference]: Without dead ends: 98
[2024-11-19 01:18:01,169 INFO  L431           NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 101 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-19 01:18:01,169 INFO  L432           NwaCegarLoop]: 132 mSDtfsCounter, 0 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 260 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2024-11-19 01:18:01,170 INFO  L433           NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 260 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2024-11-19 01:18:01,170 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 98 states.
[2024-11-19 01:18:01,175 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98.
[2024-11-19 01:18:01,176 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 98 states, 85 states have (on average 1.3294117647058823) internal successors, (113), 85 states have internal predecessors, (113), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11)
[2024-11-19 01:18:01,176 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 135 transitions.
[2024-11-19 01:18:01,177 INFO  L78                 Accepts]: Start accepts. Automaton has 98 states and 135 transitions. Word has length 103
[2024-11-19 01:18:01,177 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-11-19 01:18:01,177 INFO  L471      AbstractCegarLoop]: Abstraction has 98 states and 135 transitions.
[2024-11-19 01:18:01,178 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11)
[2024-11-19 01:18:01,178 INFO  L276                IsEmpty]: Start isEmpty. Operand 98 states and 135 transitions.
[2024-11-19 01:18:01,179 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 104
[2024-11-19 01:18:01,179 INFO  L207           NwaCegarLoop]: Found error trace
[2024-11-19 01:18:01,179 INFO  L215           NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 01:18:01,189 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 (5)] Ended with exit code 0
[2024-11-19 01:18:01,382 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /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-19 01:18:01,383 INFO  L396      AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-19 01:18:01,383 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-19 01:18:01,383 INFO  L85        PathProgramCache]: Analyzing trace with hash 873097329, now seen corresponding path program 1 times
[2024-11-19 01:18:01,384 INFO  L118   FreeRefinementEngine]: Executing refinement strategy WOLF
[2024-11-19 01:18:01,384 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1349085388]
[2024-11-19 01:18:01,384 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-19 01:18:01,384 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-19 01:18:01,392 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat
[2024-11-19 01:18:01,394 INFO  L229       MonitoredProcess]: Starting monitored process 6 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-19 01:18:01,398 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 (6)] Waiting until timeout for monitored process
[2024-11-19 01:18:01,666 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-19 01:18:01,674 INFO  L255         TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 34 conjuncts are in the unsatisfiable core
[2024-11-19 01:18:01,681 INFO  L278         TraceCheckSpWp]: Computing forward predicates...
[2024-11-19 01:18:02,950 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1
[2024-11-19 01:18:03,625 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21
[2024-11-19 01:18:04,337 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32
[2024-11-19 01:18:05,127 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 35
[2024-11-19 01:18:06,033 INFO  L349             Elim1Store]: treesize reduction 59, result has 20.3 percent of original size
[2024-11-19 01:18:06,034 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 47 treesize of output 63
[2024-11-19 01:18:06,188 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 51
[2024-11-19 01:18:06,333 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 51
[2024-11-19 01:18:06,447 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-11-19 01:18:06,448 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 54 treesize of output 51
[2024-11-19 01:18:06,544 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-11-19 01:18:06,545 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 62 treesize of output 38
[2024-11-19 01:18:06,583 INFO  L134       CoverageAnalysis]: Checked inductivity of 220 backedges. 96 proven. 84 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked.
[2024-11-19 01:18:06,583 INFO  L311         TraceCheckSpWp]: Computing backward predicates...
[2024-11-19 01:18:31,989 INFO  L136   FreeRefinementEngine]: Strategy WOLF found an infeasible trace
[2024-11-19 01:18:31,989 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1349085388]
[2024-11-19 01:18:31,989 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleMathsat [1349085388] provided 0 perfect and 1 imperfect interpolant sequences
[2024-11-19 01:18:31,990 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1511923239]
[2024-11-19 01:18:31,990 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-19 01:18:31,990 INFO  L173          SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt
[2024-11-19 01:18:31,990 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4
[2024-11-19 01:18:31,993 INFO  L229       MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null)
[2024-11-19 01:18:31,993 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (7)] Waiting until timeout for monitored process
[2024-11-19 01:18:32,701 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-19 01:18:32,713 INFO  L255         TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 36 conjuncts are in the unsatisfiable core
[2024-11-19 01:18:32,719 INFO  L278         TraceCheckSpWp]: Computing forward predicates...
[2024-11-19 01:18:34,001 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1
[2024-11-19 01:18:34,805 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21
[2024-11-19 01:18:35,576 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 24
[2024-11-19 01:18:36,239 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 24
[2024-11-19 01:18:36,898 INFO  L349             Elim1Store]: treesize reduction 47, result has 24.2 percent of original size
[2024-11-19 01:18:36,898 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 52
[2024-11-19 01:18:37,123 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 40
[2024-11-19 01:18:37,424 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 40
[2024-11-19 01:18:37,584 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 40
[2024-11-19 01:18:37,703 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 34
[2024-11-19 01:18:37,712 INFO  L134       CoverageAnalysis]: Checked inductivity of 220 backedges. 80 proven. 84 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked.
[2024-11-19 01:18:37,713 INFO  L311         TraceCheckSpWp]: Computing backward predicates...
[2024-11-19 01:18:38,204 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1511923239] provided 0 perfect and 1 imperfect interpolant sequences
[2024-11-19 01:18:38,205 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences.
[2024-11-19 01:18:38,205 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13] total 25
[2024-11-19 01:18:38,205 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [964590898]
[2024-11-19 01:18:38,205 INFO  L85    oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton
[2024-11-19 01:18:38,207 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 26 states
[2024-11-19 01:18:38,207 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF
[2024-11-19 01:18:38,209 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants.
[2024-11-19 01:18:38,210 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=161, Invalid=764, Unknown=5, NotChecked=0, Total=930
[2024-11-19 01:18:38,210 INFO  L87              Difference]: Start difference. First operand 98 states and 135 transitions. Second operand  has 26 states, 24 states have (on average 4.375) internal successors, (105), 23 states have internal predecessors, (105), 9 states have call successors, (22), 7 states have call predecessors, (22), 9 states have return successors, (22), 9 states have call predecessors, (22), 9 states have call successors, (22)
[2024-11-19 01:18:44,526 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-19 01:18:44,526 INFO  L93              Difference]: Finished difference Result 228 states and 305 transitions.
[2024-11-19 01:18:44,527 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. 
[2024-11-19 01:18:44,527 INFO  L78                 Accepts]: Start accepts. Automaton has  has 26 states, 24 states have (on average 4.375) internal successors, (105), 23 states have internal predecessors, (105), 9 states have call successors, (22), 7 states have call predecessors, (22), 9 states have return successors, (22), 9 states have call predecessors, (22), 9 states have call successors, (22) Word has length 103
[2024-11-19 01:18:44,527 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-19 01:18:44,528 INFO  L225             Difference]: With dead ends: 228
[2024-11-19 01:18:44,528 INFO  L226             Difference]: Without dead ends: 133
[2024-11-19 01:18:44,531 INFO  L431           NwaCegarLoop]: 0 DeclaredPredicates, 280 GetRequests, 235 SyntacticMatches, 2 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 484 ImplicationChecksByTransitivity, 28.9s TimeCoverageRelationStatistics Valid=469, Invalid=1506, Unknown=5, NotChecked=0, Total=1980
[2024-11-19 01:18:44,531 INFO  L432           NwaCegarLoop]: 64 mSDtfsCounter, 359 mSDsluCounter, 672 mSDsCounter, 0 mSdLazyCounter, 1036 mSolverCounterSat, 140 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 360 SdHoareTripleChecker+Valid, 736 SdHoareTripleChecker+Invalid, 1176 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 140 IncrementalHoareTripleChecker+Valid, 1036 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.5s IncrementalHoareTripleChecker+Time
[2024-11-19 01:18:44,532 INFO  L433           NwaCegarLoop]: SdHoareTripleChecker [360 Valid, 736 Invalid, 1176 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [140 Valid, 1036 Invalid, 0 Unknown, 0 Unchecked, 4.5s Time]
[2024-11-19 01:18:44,532 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 133 states.
[2024-11-19 01:18:44,544 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 124.
[2024-11-19 01:18:44,544 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 124 states, 105 states have (on average 1.2857142857142858) internal successors, (135), 106 states have internal predecessors, (135), 14 states have call successors, (14), 4 states have call predecessors, (14), 4 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14)
[2024-11-19 01:18:44,545 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 163 transitions.
[2024-11-19 01:18:44,545 INFO  L78                 Accepts]: Start accepts. Automaton has 124 states and 163 transitions. Word has length 103
[2024-11-19 01:18:44,546 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-11-19 01:18:44,546 INFO  L471      AbstractCegarLoop]: Abstraction has 124 states and 163 transitions.
[2024-11-19 01:18:44,546 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 26 states, 24 states have (on average 4.375) internal successors, (105), 23 states have internal predecessors, (105), 9 states have call successors, (22), 7 states have call predecessors, (22), 9 states have return successors, (22), 9 states have call predecessors, (22), 9 states have call successors, (22)
[2024-11-19 01:18:44,546 INFO  L276                IsEmpty]: Start isEmpty. Operand 124 states and 163 transitions.
[2024-11-19 01:18:44,547 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 104
[2024-11-19 01:18:44,547 INFO  L207           NwaCegarLoop]: Found error trace
[2024-11-19 01:18:44,547 INFO  L215           NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 01:18:44,560 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (7)] Ended with exit code 0
[2024-11-19 01:18:44,760 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 (6)] Ended with exit code 0
[2024-11-19 01:18:44,953 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,6 /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-19 01:18:44,954 INFO  L396      AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-19 01:18:44,955 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-19 01:18:44,955 INFO  L85        PathProgramCache]: Analyzing trace with hash -1232006184, now seen corresponding path program 1 times
[2024-11-19 01:18:44,956 INFO  L118   FreeRefinementEngine]: Executing refinement strategy WOLF
[2024-11-19 01:18:44,956 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1833972562]
[2024-11-19 01:18:44,956 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-19 01:18:44,956 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-19 01:18:44,956 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat
[2024-11-19 01:18:44,963 INFO  L229       MonitoredProcess]: Starting monitored process 8 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-19 01:18:44,965 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 (8)] Waiting until timeout for monitored process
[2024-11-19 01:18:45,191 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-19 01:18:45,200 INFO  L255         TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 65 conjuncts are in the unsatisfiable core
[2024-11-19 01:18:45,206 INFO  L278         TraceCheckSpWp]: Computing forward predicates...
[2024-11-19 01:18:45,517 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1
[2024-11-19 01:18:46,402 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13
[2024-11-19 01:18:46,881 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21
[2024-11-19 01:18:47,686 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 24
[2024-11-19 01:18:48,440 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32
[2024-11-19 01:18:49,366 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 43
[2024-11-19 01:18:50,153 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 59
[2024-11-19 01:18:50,357 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 62
[2024-11-19 01:18:50,675 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 76
[2024-11-19 01:18:50,957 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 88 treesize of output 79
[2024-11-19 01:18:51,289 INFO  L134       CoverageAnalysis]: Checked inductivity of 220 backedges. 94 proven. 93 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked.
[2024-11-19 01:18:51,289 INFO  L311         TraceCheckSpWp]: Computing backward predicates...
[2024-11-19 01:18:59,632 INFO  L136   FreeRefinementEngine]: Strategy WOLF found an infeasible trace
[2024-11-19 01:18:59,632 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1833972562]
[2024-11-19 01:18:59,633 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleMathsat [1833972562] provided 0 perfect and 1 imperfect interpolant sequences
[2024-11-19 01:18:59,633 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1686167646]
[2024-11-19 01:18:59,633 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-19 01:18:59,633 INFO  L173          SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt
[2024-11-19 01:18:59,633 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4
[2024-11-19 01:18:59,635 INFO  L229       MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null)
[2024-11-19 01:18:59,637 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (9)] Waiting until timeout for monitored process
[2024-11-19 01:19:00,561 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-19 01:19:00,580 INFO  L255         TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 49 conjuncts are in the unsatisfiable core
[2024-11-19 01:19:00,585 INFO  L278         TraceCheckSpWp]: Computing forward predicates...
[2024-11-19 01:19:02,158 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1
[2024-11-19 01:19:04,497 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 40